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;

int main()
{
	queue<int> Q2;
	queue<string> Q1;
	int i,n,q,t,total=0;
	char st[10];
	
	cin >> n;
	cin >> q;
	
	for(i=0;i<=n-1;i++)
	{
		cin >> st;
		Q1.push(st);
		cin >> t;
		Q2.push(t);
	}
	while(Q2.empty()!=1)
	{
		if(Q2.front()-q<=0)
		{
			total+=Q2.front();
			cout << Q1.front() << " ";
			Q1.pop();
			Q2.pop();
			cout << total << endl;
		}
		else
		{
			total+=q;
			Q1.push(Q1.front());
			Q1.pop();
			Q2.push(Q2.front()-q);
			Q2.pop();
		}
	}
	return 0;
}