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

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

int main(){
  head = 1;
  int elaps = 0;
  int i,q;
  P u;
  scanf("%d %d", &n, &q);
  tail = n + 1;
  
  for ( i = 1; i <= n; i++){
    scanf("%s", Q[i].name); //p
    scanf("%d", &Q[i].t); //time
  }

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

