#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 == LEN)tail=0;
  else tail++;
}

P dequeue(void){

  P x;
  x = Q[head];
  if(head == LEN)head=0;
  else head++;
  return x;
  
}


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


  while(n!=0){

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

