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:
using namespace std;
#include <bits/stdc++.h>
#define rep(x,to) for(i=0;i<to;i++)

int main() {
	int n,q,a,time,i,time_s=0;
	string name;
	queue<pair<string,int> > que;
	
	cin>>n>>q;
	
	rep(0,n){
		cin>>name>>time;
		que.push(make_pair(name,time));
	}
	
	while(!que.empty()){
		pair<string,int> t = que.front();
		que.pop();
		if(q < t.second){
			time_s += q;
			que.push(make_pair(t.first,t.second-q));
		}
		else{
			time_s += t.second;
			cout<<t.first<<" "<<time_s<<endl;
		}
	}
	return 0;
}