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;

public class Main {
    public static void solve(){
        Scanner scan = new Scanner(System.in);
        int n, q, i, t;
        String[] names = new String[100001];
        int[] times = new int[100001];
        Queue<Integer> processList = new LinkedList<>();
        n = scan.nextInt();
        q = scan.nextInt();
        
        for(i=0;i<n;i++){
            names[i] = scan.next();
            times[i] = scan.nextInt();
            processList.add(i);
        }
        t = 0;
        while(!processList.isEmpty()){
            int x = processList.remove();
            if(times[x]> q){
                times[x] -= q;
                t+=q;
                processList.add(x);
            }else if(times[x] == q){
                t+=q;
                System.out.println(names[x] + " " + t);
            }else{
                t += times[x];
                System.out.println(names[x] + " " + t);
            }
        }
    }
    
    public static void main(String[] args) {
        solve();
    }
}