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