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

int t[100000+10];
string name[100000+10];

int main() {
	int n,q,t_time,x;
	queue<int> Q;
	cin >> n >> q;
	for (int i=1; i<=n; i++){
		cin >> name[i] >> t[i];
		Q.push(i);
	}
	while (!Q.empty()){
		if (t[Q.front()] > q){
			t[Q.front()] -= q;
			x = Q.front();
			Q.pop();
			Q.push(x);
			t_time += q;
		}else{
			t_time += t[Q.front()];
			cout << name[Q.front()] << ' ' << t_time << endl;
			Q.pop();
		}
	}
	return 0;
}