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

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

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

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

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

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

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