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

public class Main {
	public static void main(String[] args) {
		class Combo {
			String name;
			long time;
		}
		
		Queue<Combo> remain = new LinkedList<Combo>();		
		Scanner scanner = new Scanner(System.in);
		
		long n = scanner.nextLong();
		long q = scanner.nextLong();
				
		for (int i = 0; i < n; i ++) {
			Combo process = new Combo();
			process.name = scanner.next();
			process.time = scanner.nextLong();
			remain.add(process);
		}
		scanner.close();
		

		long GlobeTime = 0;
		
		while (remain.size() > 0) {
			Combo currentProcess = remain.remove();
			
			if (currentProcess.time <= q) {
				GlobeTime += currentProcess.time;
				System.out.println(currentProcess.name + " " + GlobeTime);
			} else {
				currentProcess.time -= q;
				GlobeTime += q;
				remain.add(currentProcess);
			}
		}
		
	}
}