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<stdio.h>
#include<iostream>
#include<queue>
#include<string>
using namespace std;
int main(){
int sum=0,i,n,q,a;
string c;
queue<string> s;
queue<int> que;
scanf("%d %d\n",&n,&q);
for(i=0;i<n;i++){
cin >> c >> a;
que.push(a);
s.push(c);
}
while(!que.empty()){
a=que.front();
if(a>q){
a=a-q;
que.pop();
que.push(a);
c=s.front();
s.pop();
s.push(c);
sum=sum+q;
}
else{
que.pop();
c=s.front();
s.pop();
cout << c << ' ' << sum+a << endl;
sum=sum+a;
}
}
return 0;
}