#include<stdio.h>
#include<stdlib.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){
  Q[tail]=x;
  if(tail == n+1){
    tail=0;
  }else{
    tail++;
  }
}



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



int main(){
  int tsum = 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) c=u.t;
    else c=q;

    u.t = u.t-c;
    tsum = tsum + c;

    if(u.t>0) enqueue(u);
    else printf("%s %d\n",u.name,tsum);	
  }
  return 0;
}

