#include <stdio.h>
#include <string.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;
  tail = (tail+1)%LEN;
}

P dequeue(){
  P x = Q[head];
  head = (head+1)%LEN;
  return x;
}

int main(){
  int q, i;
  int elaps=0, c;
  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(q<u.t) c=q;
    else c=u.t;
    //c = min(q, u.t);
    u.t -= c;
    elaps += c;
    if(u.t>0) enqueue(u);
    else printf("%s %d\n", u.name, elaps);
  }
  /*int n, q, i, time[10000]
  scanf("%d %d", &n, &q);
  for(i=0; i=n; i++) scanf("%s %d", &name[i], &time[i]);
  for(i=0; i=n;i++){
    printf("%s %d\n", name[i], time[i]);
    }*/
  return 0;
  }

