#include <stdio.h>
#define LEN 100000

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

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

void enqueue(P);
P dequeue();

int main(){
	int elaps = 0;
	int i,q;
	P u;

	scanf("%d %d",&n,&q);
	for(i = 0;i < n;i++)
		scanf("%s %d",Q[i].name,&Q[i].t);
	tail = n;

	while(head != tail){
		u = dequeue();
		if(u.t <= q){
			elaps += u.t;
			printf("%s %d\n",u.name,elaps);
		}
		else{
			u.t -= q;
			elaps += q;
			enqueue(u);
		}
	}
	return 0;
}

void enqueue(P u){
	Q[tail] = u;
	if(tail+1 == LEN)
		tail = 0;
	else
		tail++;
}

P dequeue(){
	if(head == LEN)
		head = 0;
	return Q[head++];
}
