#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 100000
#define LEN 100000

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

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

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

int isEmpty(){
  if(head == tail) return 0;
  else return 1;
}

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

void enqueue(P x){
  if(isFull() == 0 ){
    fprintf(stderr,"エラー（オーバーフロー）\n");
    exit(8);
  }
  Q[tail] = x;
  if(tail+1 == MAX) tail = 0;
  else tail++;
}

P dequeue(){
  P x;
  if(isEmpty() == 0 ){
    fprintf(stderr,"エラー（アンダーフロー）\n");
    exit(8);
  }
  else{
    x = Q[head];
    if(head + 1 == MAX) head = 0;
    else head++;
    return x;
  }
}

int main(){
  int elaps = 0, c;
  int i,j,q,result;
  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;

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

  return 0;
}

