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.*;
import java.io.*;

class Main{
    public static void main(String[] args) throws IOException{
	Scanner sc = new Scanner(System.in);

	int i;
	int n;
	int t;
	int gettime = 0;
	
	Queue<String> p = new LinkedList<String>();
	Queue<Integer> time = new LinkedList<Integer>();
	
	n = sc.nextInt();
	t = sc.nextInt();
	
	for(i=0; i<n; i++){
	    p.add(sc.next());
	    time.add(sc.nextInt());
	}
	
	while(0 < p.size()){
	    if(0 < (time.peek() - t)){
		p.add(p.poll());
		time.add(time.poll() - t);
		gettime = gettime + t;
	    }else{
		gettime = gettime + time.poll();
		System.out.println(p.poll() + " " + gettime);
	    }
	}
    }
}