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 Process {
			private String name;
			private long time;
		}
		Queue<Process> queue = new LinkedList<Process>();		
		Scanner scanner = new Scanner(System.in);
		
		long n = scanner.nextLong();
		long q = scanner.nextLong();
				
		for (int i = 0; i < n; i ++) {
			Process process = new Process();
			process.name = scanner.next();
			process.time = scanner.nextLong();
			queue.add(process);
		}
		scanner.close();

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