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

public class Main {

	public static void main(String[] args) throws Exception {

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

		int totalTime = 0;
		String[] queue = new String[200000];
		int[] restTime = new int[200000];

		for(int i = 0; i < count; i++) {
			String name = sc.next();
			int time = sc.nextInt();

			queue[i] = name;
			restTime[i] = time;
		}

		int qhead = 0;
		int qtail = count;

		while(qhead != qtail) {
			if(restTime[qhead] <= q) {
				totalTime += restTime[qhead];
				System.out.println(queue[qhead] + " " + totalTime);
				qhead++;
			} else {
				queue[qtail] = queue[qhead];
				restTime[qtail] = restTime[qhead] - q;
				totalTime += q;
				qhead++;
				qtail++;
			}
		}

	}

}