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

public class Main {
    private static Scanner scanner;
    public static void main(String[] args){
        scanner = new Scanner(System.in);
        LinkedList<String> name = new LinkedList<String>();
        LinkedList<Integer> time = new LinkedList<Integer>();
        int length = scanner.nextInt();
        int q = scanner.nextInt();
        int qTime = 0;
        for(int i = 0;i < length;i++){
            name.add(scanner.next());
            time.add(scanner.nextInt());
        }
        while(!name.isEmpty()){
            if(time.peek() <= q){
                System.out.print(name.poll() + " ");
                qTime = qTime + time.poll();
                System.out.println(qTime);
            }else{
                name.add(name.poll());
                time.add(time.poll() - q);
                qTime = qTime + q;
            }
        }
    }

}