#include<stdio.h>
#include<string.h>
#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;
	if( tail + 1 == LEN ) tail = 0;
	else tail = tail + 1;
}

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

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