#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 == n){
    tail =0;
  }else{
    tail++;
  }


}

P dequeue(){
  P y;
  y = Q[head];
  if(head == n){
    head = 0;
  }else{
    head++;
  }
  return y;

}

int empty(){
  if(head == tail){
    return 0;
  }else{
    return 1;
  }
}



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

