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;

class Process {
	String name;
	int time;

	public Process(String name, int time) {
		super();
		this.name = name;
		this.time = time;
	}

	public void proceed(int q) {
		this.time -= q;
	}

}

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int q = sc.nextInt();
		sc.nextLine();

		Queue<Process> queue = new LinkedList<>();

		for (int i = 0; i < n; i++) {
			String[] input = sc.nextLine().split(" ");
			Process p = new Process(input[0], Integer.parseInt(input[1]));
			queue.add(p);
		}

		int passedTime = 0;
		while(true) {

			if(queue.isEmpty()) break;

			Process now = queue.poll();
			if(now.time > q) {
				now.proceed(q);
				passedTime += q;
				queue.add(now);
			} else {
				passedTime += now.time;
				System.out.printf("%s %d\n", now.name, passedTime);
			}
		}
	}
}