#include <stdio.h>
#define LEN 100005

typedef struct pp{
  char name[100];
  int t;
}P;

P Q[LEN+1];
int head=0, tail=0, n;

void enqueue(P x){
  Q[tail] = x;
  if(tail+1 == LEN+1){tail=0;}
  else tail++;
}

P dequeue(){
  P x;
  x=Q[head];
  if(head+1==LEN+1){head=0;}
  else head++;
  return x;
}


int main(){
  int elaps = 0, c;
  int i, q;
  P u;
  scanf("%d %d", &n, &q);

  for ( i = 0; i < n; i++){
    scanf("%s", Q[i].name);
    scanf("%d", &Q[i].t);
    enqueue(Q[i]);
  }

  while(1)
    {
      if(head==tail)break;
      u=dequeue();
      u.t=u.t-q;
      if(u.t<=0)
      {
	elaps = elaps + q + u.t;
	printf("%s %d\n",u.name,elaps);
      }
      else
      {
	elaps = elaps + q;
	enqueue(u);
      }
    }

  
  return 0;
}

