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 <string>
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <queue>
using namespace std;
int main(void)
{
	queue<pair<string,int>> Q;
	int n, q, x, a, cou = 0, time = 0;
	string name;
	cin >> n >> q;
	for (int i = 0; i < n; i++) {
		cin >> name >> x;
		Q.push(make_pair(name, x));
	}
	while(!(Q.empty())) {
		pair<string, int> p = Q.front(); Q.pop();
		if (p.second > q) {
			Q.push(make_pair(p.first, p.second - q));
			time += q;
		}
		else {
			time += p.second;
			cout << p.first << " " << time << endl;
		}
	}
}