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>
using namespace std;
#define S 1000000
typedef struct{char n[10];int t;}QUE;
QUE que[S];
int main(){
int i=0,T=0,h=0,t,n,q;
scanf("%d %d",&n,&q);
for(t=n;i<n;)scanf("%s %d",que[i++].n,&que[i].t);
while(h!=t){
bool f=que[h].t<=q||t-h==1;
T+=f?que[h].t:q;
if(f)printf("%s %d\n",que[h].n,T);
else{que[h].t-=q;que[t]=que[h];t=S==t+1?0:t+1;}
h=S==h+1?0:h+1;
}
}