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 <cstdio>
#include <queue>
#include <algorithm>

#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef pair<int, int> P;

int n, q;
char s[100000][11];
queue<P> x;

int main(){
	scanf("%d%d", &n, &q);
	rep(i, n){
		int t;
		scanf("%s%d", s[i], &t);
		x.push(P(i, t));
	}
	int t = 0;
	while(!x.empty()){
		P v = x.front();
		x.pop();
		if(v.second <= q){
			t += v.second;
			printf("%s %d\n", s[v.first], t);
		}
		else{
			t += q;
			v.second -= q;
			x.push(v);
		}
	}
	return 0;
}