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

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

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

void enqueue(Qu x){
  Q[tail]=x;
  tail=(tail+1)%LEN;
}

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

int min(int a,int b){
  if(a<b)
    return a;
  else
    return b;
}


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

