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.Scanner;
import java.util.ArrayDeque;
import java.util.Queue;

class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        Queue<Integer> queue = new ArrayDeque<>();
        
        int n = sc.nextInt();
        int q = sc.nextInt();
        String name[] = new String[n];
        int time[] = new int[n];
        for(int i = 0; i < n; i++){
            name[i] = sc.next();
            time[i] = sc.nextInt();
            queue.add(i);
        }
        
        int x = 0;
        while(!queue.isEmpty()){
            int y = queue.poll();
            if(time[y] <= q){
                x += time[y];
                System.out.println(name[y]+" "+x);
            }else{
                x += q;
                time[y] -= q;
                queue.add(y);
            }
        }
    }
}