Problem: Notes

Template in C

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 1000
* 1 ≤ timei ≤ 50000
* 1 ≤ length of namei ≤ 10
* 1 ≤ Sum of timei ≤ 1000000

Input

n q
name1 time1
name2 time2
...
namen timen


In the first line the number of processes n and the quantum q are given separated by a single space.

In the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.

Output

For each process, prints its name and the time the process finished in order.

Example

Input

5 100
p1 150
p2 80
p3 200
p4 350
p5 20


Output

p2 180
p5 400
p1 450
p3 550
p4 800

Solution (in CPP):

Solution:
#include<stdio.h>

struct Queue{
	char s[15];
	int time;
};
Queue name[1000000];
int main(){
	int i,n,j,k,q;
	
	scanf("%d",&n);
	scanf("%d",&q);
	getchar();
	int cur=0;
	for(i=0;i<n;i++){
		scanf("%s",name[i].s);
		scanf("%d",&name[i].time);
		getchar();
	}
	for(i=0;i<n;i++){
		if(name[i].time>q){
			name[i].time-=q;
			cur+=q;
			name[n]=name[i];
			n++;
		}
		else{
			cur+=name[i].time;
			printf("%s %d\n",name[i].s,cur);
		}
	}
}