#include<stdio.h>
#include<string.h>
#define N 100005
typedef struct pp{
  char name[100];
  int t;
}P;

P Q[N];
int hazime,owari,n;
void enqueue(P x){
  Q[owari] = x;
  owari=(owari+1)%N;
}
P dequeue(){
  P x=Q[hazime];
  hazime=(hazime+1)%N;
  return x;
}
int min(int a,int b){return a<b?a:b;}

int main(){
  int karuma=0,c;
  int i,q;
  P u;
  scanf("%d%d",&n,&q);
  for(i=1;i<=n;i++){
  scanf("%s",Q[i].name);
  scanf("%d",&Q[i].t);
 }
 hazime=1;owari=n+1;

 while(hazime!=owari){
   u=dequeue();
   c=min(q,u.t);
   u.t-=c;
   karuma+=c;
   if(u.t>0)enqueue(u);
   else{
     printf("%s %d\n",u.name,karuma);
   }
 }
 return 0;
}


