#include<stdio.h>
#include<string.h>

#define N 100000

typedef struct {
  char name[10];
  int time;
}queue;

void initialize(queue);
void enqueue(queue);
queue dequeue();
//int isEmpty();
//int isFull();

queue Q[N];
int head,tail,n;


/*void initialize(struct queue *q){
  int i;

  q->head=0;
  q->tail=0;
  for(i=0; i < N; ++i){
    q->name[i]=' ';
    q->time=0;
  }
  }*/

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

queue dequeue(){
  queue x = Q[head];
  head = (head + 1)%N;
  return x;
}

int min(int a,int b){return a<b ? a:b;}

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

  for(i=1; i<= n;i++){
    scanf("%s",Q[i].name);
    scanf("%d",&Q[i].time);

  }

  head = 1; tail = n+1;

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