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

typedef struct qu {
	char name[100];
	int t;
} TT;
	TT Q[LEN];
	int head,tail,n;
	
void enqueue(TT x){
	Q[tail] = x;
	
	tail = (tail+1) % LEN;

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

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

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

}
