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 JAVA):

Solution:
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();
        Queue<Process> queue = new ArrayDeque<Process>();
        for(int i=0; i<n; i++) {
            Process p = new Process(sc.next(),sc.nextInt());
            queue.add(p);
        }
        int pTime = 0;
        int b = 0;
        String[] result = new String[n];
        while(queue.size()>0) {
            Process pro = queue.poll();
            if(pro.time>q) {
                pro.time -= q;
                queue.add(pro);
                pTime += q;
            } else {
                pTime += pro.time;
                result[b] = pro.name+" "+Integer.toString(pTime);
                b++;
            }
        }
        for(String s:result) {
            System.out.println(s);
        }
    }
}
class Process{
    String name;
    int time;
    Process(String name, int time) {
        this.name=name;
        this.time=time;
    }
}