#include <stdio.h>
//#include <>
#define LEN 100005

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

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

void enqueue(P x){
  Q[tail] = x;
  tail++;
  tail = tail % LEN;
}

P dequeue(){
  P ret;
  ret = Q[head];
  head++;
  head = head % LEN;
  return ret;
}


int main(){
  int elaps = 0, c , zan;
  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);
  }
  head =0;
  tail = n;
  zan = n;
  while ( head != tail)
    {
      u = dequeue();
      if (u.t <=  q){
 elaps+=  u.t;
	 printf("%s %d\n",u.name , elaps);

	 }
      else if ( u.t > q){ elaps += q;u.t -= q;enqueue(u);}
    }
  return 0;
}
