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

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

Task Q[N];
int head,tail;
void enqueue(Task x){
    Q[tail]=x;
    tail=(tail+1)%N;
}
Task dequeue(){
    Task x=Q[head];
    head=(head+1)%N;
    return x;
}
int min(int a,int b){
	return a<b?a:b;
}
int main(void){
    int n,q,i,c,elaps=0;
    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){ 
        Task 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;
}