#include <stdio.h>
#include <stdlib.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){
  if(tail == LEN){
    exit(2);
  }
  Q[tail] = x;
  if(tail + 1 == LEN){
    tail = 0;
  }
  else{
    tail++;
  }
}

P dequeue(){
  if(head == LEN){
    exit(3);
  }
  P x = Q[head];
  if(head + 1 == LEN){
    head = 0;
  }
  else{
    head++;
  }
    return x;

}

min(int a,int b){
  if(a < b)return a;
  else return b;
}

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);
    }
  head = 1;
  tail = n + 1;

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

  
  return 0;
}

