#include <stdio.h>
#include <string.h>
#define LEN 100005

typedef struct pp{
  char name[100];
  int t;
}P;

P Q[LEN+1];
int head = 1, tail = 0, n;

void enqueue(P x){
  strcpy(Q[tail].name, x.name);
  Q[tail].t = x.t;
  tail++;
  if(tail > n) tail = 0;
}

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


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

  return 0;
}

