#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 compare( int a, int tai){

  return a < tai ? a : tai;
}


void enqueue(P x){
  
  Q[tail] = x;
  tail = ( tail + 1 ) % LEN;

}

P dequeue(){
  
  P y = Q[head];
  head = ( head + 1) % LEN;
  return y;
  

}


int main(){
  int elaps = 0, c;
  int i, q;
  P z;
  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){

    z = dequeue();
    c = compare( q, z.t);
    z.t -= c;
    elaps += c;
    if ( z.t > 0 ) enqueue(z);
    else{
      printf("%s %d\n",z.name,elaps);
    }
  }
  return 0;
}

