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 <queue>
using namespace std;
int main() {
  int n, q;
  cin >> n >> q;
  queue<string> q1;
  queue<int> q2;
  for(int i=0; i<n; i++) {
   string name;
   int time;
   cin >> name >> time;
   q1.push(name);
   q2.push(time);
  }
  int time = 0;
  while (!q1.empty()) {
   string s = q1.front();
   int n = q2.front() - q;
   if (n <= 0) {
    q1.pop();
	q2.pop();
	time += n + q;
	cout << s << " " << time << endl;
   }
   else {
    q1.pop();
	q2.pop();
	q1.push(s);
	q2.push(n);
	time += q;
   }
  }
}