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