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 <string>
using namespace std;

struct foo {
	string s;
	int a;
};

int main(){
	int n, v, time = 0;
	foo f[100000];
	cin >> n >> v;
	for (int i = 0; i < n; i++) {
		cin >> f[i].s >> f[i].a;
	}
	int j = n, b = 0, flag = n;
	while (flag > 0) {
		f[b].a -= v,time += v;
		if (f[b].a > 0) {
			f[b+j] = f[b];
		}else {
			time += f[b].a, j--, flag--;
			cout << f[b].s << " " << time << endl;
		}
		b++;
		if (b > 99999)b = 0;
		if (j + b > 99999)j -= 100000;
		if (j + b < 0)j += 100000;
	}

	return 0;
}