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.Deque;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.ArrayDeque;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sca = new Scanner(System.in);
        int n = sca.nextInt();
        Deque<Integer> quu = new LinkedList<>();
        Deque<String> name = new LinkedList<>();
        int hour = 0;
        
        int qa = sca.nextInt();
        int K = 0;
        while (K < n) {
            name.add(sca.next());
            quu.add(sca.nextInt());
             ++K;
        }
        while (quu.size() > 0) {
            
            quu.addLast(quu.poll() - qa);
            name.addLast(name.poll());
            hour += qa;
            
            if (quu.peekLast() <= 0) {
                hour += quu.pollLast();;
                System.out.println(name.pollLast() + " " + hour);
            }
        }
    }
}