#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 syo(int x,int y){
  if(x>y)return y;
  else return x;
}  

void enque(P x){
  Q[tail]=x;
  tail=(tail+1)%LEN;

}

P deque(){

  P y=Q[head];
  head=(head+1)%LEN;
  return y;
}


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

