#include<stdio.h>
#include<string.h>
#define LEN 100005

typedef struct{
  char name[100];
  int t;
}P;

P Q[LEN];
int head,tail;

void enqueue(P x){
  Q[tail] = x;
  tail = (tail+1) % LEN;
}
P dequeue(){
  P x = Q[head];
  head = (head+1)%LEN;
  return x;
}
int min(int a,int b){
  return a<b ? a:b;
}

int main(){
  int n,q;
  int time,c;
  int i;
  P que;
  
  scanf("%d %d",&n,&q);
  for(i=1;i<=n;i++){
    scanf("%s%d",Q[i].name,&Q[i].t);
  }

  head=1;
  tail=n+1;

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