include <stdio.h>
#include <string.h>
#define LEN 100005
#define MAX

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

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

void initialize(){
  head = tail = 0;
}

int isEmpty(){
  return head == tail;
}

int isFull(){
  if(head == (tail+1)%LEN) return 1;
  else return 0;
}

void enqueue(P x) {
  if(isFull()){
     printf("eeror(overflow\n");
  }
  strcpy(Q[tail].name, x.name);
  Q[tail].t = x.t;
  if(tail+1 == LEN){
    tail = 0;
  } else {
    tail++;
  }
}

P dequeue() {
  P x;
  if(isEmpty()){
     printf("error(underflow\n");
  }
  strcpy(x.name, Q[head].name);
  x.t = Q[head].t;
  if(head+1 == 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(head != tail){
    u = dequeue();
    if(q < u.t) c = q;
    else if(q > u.t) c = u.t;
    u.t -= c;
    elaps += c;
    if(u.t > 0){
      enqueue(u);
    } else {
      printf("%s %d\n", u.name, elaps);
    }
  }

  return 0;
}