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

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

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

void enqueue(P x){
  if(head == (tail + 1) % LEN)
    printf("error(?????????????????????)\n");
  Q[tail] = x;
  if(tail + 1 == LEN)
    tail = 0;
  else tail++;
}

P dequeue(){
  P x;
  if(head == tail) printf("error(??¢??????????????????)\n");
  x = Q[head];
  if(head + 1 == LEN) head = 0;
  else head++;
  return x;
}


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