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.*;
public class Main {
    public static void main(String [] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();
        int time = 0;
        int [] T = new int[n];
        String [] Name = new String[n];
        Queue<Integer> L = new ArrayDeque<>();
        ArrayList<Integer> opt = new ArrayList<>();
        for(int i=0;i<n;i++){
            Name[i] = sc.next();
            T[i] = sc.nextInt();
            L.add(i);
        }
        while(L.size()!=0){
            int p_num = L.poll();
            if(T[p_num]-q>0){
                time+=q;
                T[p_num]-=q;
                L.add(p_num);
            }
            else{
                time+=T[p_num];
                T[p_num]=time;
                opt.add(p_num);
            }
        }
        for(int i:opt) System.out.println(Name[i]+" "+T[i]);
    }
}