#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+1 >= LEN+1) tail=0;
    else Q[tail++]=x;
}

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


int main(){
  int elaps = 0, c;
  int i, q;
  P u;
  scanf("%d %d", &n, &q);
  head=0;
  tail=n+1;

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