#include<stdio.h>
#define LEN 100005
typedef struct pp{
	char name[11];
	int t;
}P;
int head,tail,n;
P Q[LEN];
int min(int a,int b);
P dequeue(void);
void enqueue(P x);
int main(void)
{
	int elaps=0,c;
	int i,q;
	P u;
	scanf("%d %d",&n,&q);
	for (i=1;i<=n;i++){
		scanf("%s %d",Q[i].name,&Q[i].t);
	}
	head=1;tail=n+1;
	
	while (head!=tail){
		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;
}
int min(int a,int b){return a<b?a:b;}
P dequeue(void)
{
	P x=Q[head];
	head=(head+1)%LEN;
	return x;
}
void enqueue(P x)
{
	Q[tail]=x;
	tail=(tail+1)%LEN;
}