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.*;

class CPU{
    int time;
    String name;
}

public class Main {
    public static void main(String[] Args){
        Scanner sc = new Scanner(System.in);
        Queue<CPU> que = new LinkedList<>();
        int n = sc.nextInt();
        CPU[] cc = new CPU[n];
        int q = sc.nextInt();
        sc.nextLine();
        for(int i=0;i<n;i++){
            String[] tt = sc.nextLine().split(" ");
            cc[i] = new CPU();
            cc[i].name = tt[0];
            cc[i].time = Integer.parseInt(tt[1]);
            que.add(cc[i]);
        }
        int tot=0;
        while(!que.isEmpty()){
            CPU now = que.poll();//返回第一个元素，并删除
            if(now.time > q){
                now.time -= q;
                que.add(now);
                tot += q;
            }
            else{
                tot += now.time;
                System.out.println(now.name + " " + tot);
            }
        }
    }

}