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 <queue>
#include <cctype>
#include <iostream>
#include <string>

using namespace std;

struct PS {
	string name;
	unsigned int t;
};

int main()
{
	unsigned int n, s, t = 0;
	queue<PS> ps;

	cin >> n >> s;

	for (unsigned int i = 0; i < n; ++i) {
		PS x;
		cin >> x.name >> x.t;
		ps.push(x);
	}

	while ( ! ps.empty()) {
		PS x;
		x = ps.front();
		ps.pop();

		if (x.t <= s) {
			t += x.t;
			cout << x.name << " " << t << endl;
		} else {
			t += s;
			x.t -= s;
			ps.push(x);
		}
	}

	return 0;
}