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