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 <bits/stdc++.h>
using namespace std;
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, q, now = 0, c;
	cin >> n >> q;

	vector<string> name(n);
	vector<int> time(n);
	queue<int> Q;

	for (int i = 0; i < n; ++i) {
		cin >> name.at(i) >> time.at(i);
		Q.push(i);
	}

	while (Q.size() > 0) {
		c = Q.front();
		Q.pop();
		if (time.at(c) > q) {
			time.at(c) -= q;
			now += q;
			Q.push(c);
		} else {
			now += time.at(c);
			cout << name.at(c) << " " << now << endl;
		}
	}
}