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 <cstdio>
#include <queue>
#include <map>
using namespace std;

int main()
{
	map<string, int> time;
	queue<string> nums;
	int n, t; scanf("%d%d",&n,&t);
	for(int i = 0; i < n; ++i) {
		string s; int v; cin>>s>>v;
		time[s] = v;
		nums.push(s);
	}
	int ms = 0;
	while(!nums.empty()) {
		string f = nums.front(); nums.pop();
		int f_t = time[f];
		if(f_t <= t) {
			ms += f_t;
			time[f] = 0;
			cout<<f<<" "<<ms<<endl;
		} else {
			ms += t;
			time[f] -= t;
			nums.push(f);
		}
	}
	return 0;
}