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;

// You cant store primitive types in queue?

public class Main{
    public static void main(String[] args) {
        Queue<String> q = new LinkedList<>();

        Scanner input1 = new Scanner(System.in);
        int length = input1.nextInt();
        int QUANTUM = input1.nextInt();
        int totalTime=0;
        int result; // This is the time of each item
        String name;

        input1.nextLine();
        // Takes all the inputs and put into the queue
        for(int i=0;i<length;i++){
            q.add(input1.nextLine());
        }

        while (q.size()!=0){
            String removed = q.remove();
            String[] removeItem = removed.split(" ");

            name =removeItem[0];
            result = Integer.valueOf(removeItem[1])-QUANTUM;
            if (result >0){
                q.add(name+" "+result);
                totalTime += QUANTUM;
            }
            else{
                totalTime += result+QUANTUM;
                System.out.println(name+" "+totalTime);
            }

        }
    }
}