#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;

/*int isEmpty(){
  if(head == tail) return 0;
  else return 1;
}*/

/*int isFull(){
  if(head == (tail + 1) % n)  return 1;
  else return 0;
}*/
void enqueue(P x){
  //if(isFull()){}
  Q[tail].t = x.t;
  strcpy(Q[tail].name,x.name);
  tail = (tail + 1) % LEN;
}

P dequeue(){
  P x;
  //if(isEmpty()){};
  x = Q[head];
  head = (head + 1) % LEN;
  return x;
}

void initialize(){
  head = 1;
  tail = n + 1;
}


int main(){
  int elaps = 0;
  int i, q;
  P u;
  scanf("%d %d", &n, &q);
  initialize();
  for ( i = 1; i <= n; i++){
    scanf("%s", Q[i].name);
    scanf("%d", &Q[i].t);
  }

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

  return 0;
}

