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) {
		int n = 0, q = 0;
		Scanner scanner = new Scanner(System.in);
		try {
			n = scanner.nextInt();
			q = scanner.nextInt();
		} catch (Exception e) {
		}
		ArrayList<Queue> qu = new ArrayList<Queue>();
		for (int i = 0; i < n; i++) {
			try {
				String name = scanner.next();
				int time = scanner.nextInt();
				qu.add(new Queue(name, time));
			} catch (Exception e) {
			}
		}

		int i = 0, count = 0, alltime = 0;
		while (qu.size() > 0) {
			i = i % qu.size();
			int t = qu.get(i).time;
			if (t <= q) {
				alltime += t;
				System.out.println(qu.get(i).name + " " + alltime);
				qu.remove(i);
				i--;
			} else {
				alltime += q;
				qu.get(i).time -= q;
			}
			i++;
		}

	}
}


class Queue {
	String name;
	int time;

	public Queue(String n, int t) {
		name = n;
		time = t;
	}
}