#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 1;
  }
  else return 0;
}

int isFull(){
  if(head == (tail + 1) % LEN) {
    return 1;
  }
  else return 0;
}

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

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


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