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.*;

/**
 * B
 */
public class Main {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        Queue<String> name_array = new ArrayDeque<String>();
        Queue<Integer> time_array = new ArrayDeque<Integer>();

        int n = sc.nextInt();
        int q = sc.nextInt();
        
        int sum_time = 0;

        for (int i = 0; i < n; i++) {
            name_array.add(sc.next());
            time_array.add(sc.nextInt());
        }

        sc.close();

        while (name_array.peek() != null) {

            String str = name_array.remove();
            int tmp = time_array.remove();

            if(tmp > q) {
                name_array.add(str);
                time_array.add(tmp - q);
                sum_time += q;
            } else {
                System.out.println(str + " " + (sum_time + tmp));
                sum_time += tmp;
            }

        }
    }
}