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<iostream>
#include<queue>
using namespace std;
struct elem{
	int time;
	string name;
};
int main(){
	queue<elem> que;
	int n,q,curtime=0;
	cin>>n>>q;
	struct elem x;
	for(int i=0;i<n;i++){
		cin>>x.name>>x.time;
		que.push(x);
	}	
	while(!que.empty()){
		x=que.front();
		if(x.time<=q){
			curtime += x.time;
			cout<<x.name<<" "<<curtime<<endl;
		}else{
			x.time -= q;
			curtime += q;
			que.push(x);
		}
		que.pop();
	}
	return 0; 
}