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.io.*;
import java.util.*;

public class Main {
    public static void main(String args[]) {
        int n, q, time = 0;
        Queue<String> queueName = new ArrayDeque<String>();
        Queue<Integer> queueTime = new ArrayDeque<Integer>();
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();
        q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < n; i++) {
            String s[] = sc.nextLine().split(" ");
            queueName.add(s[0]);
            queueTime.add(Integer.parseInt(s[1]));
        }

        while (!queueName.isEmpty()) {
            String qn = queueName.poll();
            int t = queueTime.poll();

            time += (t > q)? q: t;

            if (t > q) {
                queueTime.add(t - q);
                queueName.add(qn);
            } else {
                System.out.println(qn + " " + time);
            }
        }
    }
}