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.ArrayList;
import java.util.Scanner;

public class Main {

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

		int n = sc.nextInt();
		int q = sc.nextInt();
		int total = 0;
		int count = 0;

		ArrayList<Integer> time = new ArrayList<>();
		ArrayList<String> name = new ArrayList<>();

		for (int i = 0; i < n; i++) {
			name.add(sc.next());
			time.add(sc.nextInt());
		}

		while (time.size() != 0) {
			if (time.get(count) <= q) {
				total += time.get(count);
				System.out.printf("%s %d\n", name.get(count), total);
				time.remove(count);
				name.remove(count);
				count = count >= name.size() ? 0 : count;
			} else {
				total += q;
				time.set(count, time.get(count) - q);
				count = ++count >= name.size() ? 0 : count;

			}

		}

	}
}