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

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

P Q[MAX],x;
int head, tail, n,d;
int min(int,int);
void enqueue(P x);
P dequeue(void);


int main(){
  int elaps = 0, c;
  int i,q;
  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();
    c = min(q,u.t);
    u.t -= c;
    elaps += c;
    if(u.t > 0){
      enqueue(u);
    }
    else{
      printf("%s %d\n",u.name,elaps);
    }
  }

  return 0;
}


int min(int a, int b){
  d = a<b ? a:b;
  return d;
}

void enqueue(P x){  
    Q[tail] = x;
    tail = (tail+1) % MAX;
    

}

P dequeue(){
  P x = Q[head];
  head = (head+1) % MAX;

  return x;

}



