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

P dequeue(void);


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(head!=tail){
    u=dequeue();

    if(u.t<=q){
      elaps += u.t;
      printf("%s %d\n",u.name,elaps);
    }
    else if(u.t>q){
      elaps += q;
      u.t=u.t-q;
      enqueue(u);
    }

  }


  return 0;
}

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

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

}

