Problem:
There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.

For example, we have the following queue with the quantum of 100ms.

A(150) - B(80) - C(200) - D(200)

First, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).

B(80) - C(200) - D(200) - A(50)

Next, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.

C(200) - D(200) - A(50)

Your task is to write a program which simulates the round-robin scheduling.

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.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 1000

1 ≤ timei ≤ 50000

1 ≤ length of namei ≤ 10

1 ≤ Sum of timei ≤ 1000000

Sample Input 1

5 100
p1 150
p2 80
p3 200
p4 350
p5 20

Sample Output 1

p2 180
p5 400
p1 450
p3 550
p4 800

Notes

Template in C

Solution in C (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <string.h>

struct Queue{
char name[10];
int num;
int check;
};

int main(){
int n, q, i, count=0, t=0, total=0;
struct Queue x[100000];
scanf("%d%d", &n, &q);
for(i=0;i<n;i++){
scanf("%s%d", x[i].name, &x[i].num);
total+=x[i].num;
x[i].check=0;
}

while(count<n){
for(i=0;i<n;i++){
if(x[i].num-q<=0 && x[i].check==0){
t+=x[i].num;
printf("%s %d\n", x[i].name, t);
count++;
x[i].num=0;
x[i].check=1;
}
 else if(x[i].num-q>0 && x[i].check==0){
x[i].num-=q;
t+=q;
}
}
}
return 0;
}