#include<stdio.h>
#include<string.h>
#define LEN 100005
#define MAX 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==MAX)
    tail=0;
  else
    tail++;
}

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

}


int main(){
  int elaps = 0, c;
  int i, q;
  P u;
  scanf("%d %d", &n, &q);

  for ( i = 1; i <= n+1; i++){
    scanf("%s", Q[i].name);
    scanf("%d", &Q[i].t);
  }
  head=0;
  tail=0;
  while(head!=tail){
    u=dequeue();
    if(q>u.t){
      c=u.t;
    }
    else{
      c=q;
    }
    u.t-=c;
    elaps+=c;
    if(u.t>0){
      enqueue(u);
    }
    else{
      printf("%s %d\n",u.name,elaps);
    }
  }
  return 0;
}