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) {
	Queue<String> name = new LinkedList<String>();
	Queue<Integer> time = new LinkedList<Integer>();
	
	Scanner in = new Scanner(System.in);
	
	int elems = in.nextInt();
	int timer = in.nextInt();
	int timePassed = 0;
	in.nextLine();
	
	String eName = "";
	int eTime = 0;
	
	for (int i = 0; i < elems; i++) {
		eName = in.next();
		name.add(eName);
		eTime = in.nextInt();
		time.add(eTime);
	}
	
	while(!name.isEmpty()) {
		String str = name.poll();
		int remainingTime = time.poll();
		if (remainingTime <= timer) {
			timePassed += remainingTime;
			System.out.println(str + " " + timePassed);
		}
		else {
			remainingTime -= timer;
			name.add(str);
			time.add(remainingTime);
			timePassed += timer;
		}
	}
}
}