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

void enqueue(P x){
  Q[tail] = x;
  if (tail + 1 == LEN){
    tail = 0;
  }
  else{
    tail = tail + 1;
  }  
}

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


int main(){
  int elaps = 0, c;
  int i, q, total = 0;
  P u;
  scanf("%d %d", &n, &q);  
  for ( i = 1; i <= n; i++){    
    scanf("%s", u.name);
    scanf("%d", &u.t);
    enqueue(u);
  }
  
  while(n>0){
    u = dequeue();
    if (u.t <= q){
      elaps += u.t;
      printf("%s %d\n", u.name, elaps);
      n--;
    }    
    else if(u.t>q){
      u.t -= q;
      elaps += q;
      enqueue(u);
    }   
  } 
  return 0;
}