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

#define LEN 100005

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

P Q[LEN];
int head,tail,n;

P dequeue(void);
void enqueue(P);
int min(int ,int );

int main(){
  int i,q;
  P u;
  int elaps = 0,c; /*elapsは経過時間*/

  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();
    c = min(q,u.t);
    u.t -= c;
    elaps += c;
    if(u.t > 0) enqueue(u); /*処理が完了していない場合は後尾に格納*/
    else{
      printf("%s %d\n",u.name,elaps);
    }
  }
  return 0;
}

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

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

int min(int a,int b){
  if(a > b)return b;
  else return a;
}

