#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;

int min(int,int);
P dequeue(void);
void enqueue(P);


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

void enqueue(P x){
  Q[tail]=x;
  if(tail+1==LEN)
  tail = 0;
  else tail++;
  }

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

int min(int x,int y){
  if(x>y)return y;
  else return x;
}

