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

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

void enqueue(P);
P dequeue(void);

P Q[LEN+1];
int head = 0, tail = 0, n;

void enqueue(P u){
  if(head == (tail + 1) % LEN){
    printf("overfullow\n");
    exit(8);
  }
  Q[tail] = u;
  if(tail+1 == LEN){
    tail = 0;
  }else{
    tail++;
  }
}

P dequeue(){
  P u;
  if(head == tail){
    printf("underfullow\n");
  }
  u = Q[head];
  if(head+1 == LEN){
    head = 0;
  }else{
    head++;
  }
  return u;
}


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

  for ( i = 0; i < n; i++){
    scanf("%s", Q[i].name);
    scanf("%d", &Q[i].t);
    enqueue(Q[i]);
  }

  while(c < n){
    u = dequeue();
    if(u.t > q){
      elaps += q;
      u.t -= q;
      enqueue(u);
    }else{
      elaps += u.t;
      printf("%s %d\n", u.name, elaps);
      c++;
    }
    
  }

  
  return 0;
}

