#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 == LEN)tail = 1;
  else tail++;
}

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


int main(){
  int elaps = 0, c;
  int i,q,a=0;
  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();
    u.t -= q;
    if(u.t == 0){
      elaps += q;
    }
    if(u.t < 0){
      a = q+u.t;
      u.t = 0;
      elaps += a;
    }
    if(u.t > 0){
      enqueue(u);
      elaps += q; 
    }
    else {
      printf("%s %d\n",u.name,elaps);
    }
  }
  
  
  return 0;
}

