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.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Iterator;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Queue<String> keys = new LinkedList<>();
        Queue<Integer> values = new LinkedList<>();
        Integer timestamp = 0;

        int ceiling = in.nextInt();
        int quantum = in.nextInt();
        while (ceiling > 0) {
            keys.add(in.next());
            values.add(in.nextInt());
            --ceiling;
        }

        while (!values.isEmpty()) {
                if (values.peek() <= quantum) {
                    timestamp += values.poll();
                    System.out.println(keys.poll() + " " + timestamp);
                } else {
                    int temp = values.poll() - quantum;
                    String tempo = keys.poll();
                    keys.add(tempo);
                    values.add(temp);
                    timestamp += quantum;
            }
        }
    }
}