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{
        static class Pair {
                int quan=0;
                String val="";
                Pair(int x , String y){
                    this.quan = x;
                    this.val = y;
                }
            }


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();
        Queue<Pair> q = new LinkedList<>();
        for (int i = 0; i < N; i++) {
            String name = sc.next();
            int quantum = sc.nextInt();
            q.add(new Pair(quantum,name));
        }

        int elapse = 0;
        while(!q.isEmpty()){
            Pair current = q.poll();
            int qu = current.quan;
            if(qu > Q){
                current.quan = qu-Q;
                elapse+=Q;
                q.add(current);
            }else{
                elapse+=current.quan;
                System.out.println(current.val +" "+elapse);
            }
        }




    }

}