#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;
	tail = (tail + 1) % (LEN + 1);
}

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


int main(){
  int elaps = 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);
  }
  
  head = 1;
  tail = n + 1;

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