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;

class Proc{
public:
	string nam;
	int tim;
	Proc(){ nam = ""; tim = 0; }
};

int main(){
	queue<Proc> Q;

	int n, q;
	cin >> n >> q;

	for (int i = 0; i < n; i++){
		Proc P;
		cin >> P.nam >> P.tim;

		Q.push(P);
	}

	int total_tim = 0;

	while (!Q.empty()){
		Proc P = Q.front(); Q.pop();

		if (P.tim <= q){
			total_tim += P.tim;

			cout << P.nam << " " << total_tim << endl;
		}
		else{
			total_tim += q;
			P.tim -= q;

			Q.push(P);
		}
	}
	return 0;
}