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

public class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int q = scan.nextInt();
		Queue<Data> queue = new ArrayDeque<Data>();
		for(int i = 0; i < n; i++) {
			Data d = new Data(scan.next(), scan.nextInt());
			queue.add(d);
		}
		scan.close();
		StringBuilder sb = new StringBuilder();
		int time = 0;
		while(queue.size() != 0) {
			Data d = queue.poll();
			if(q >= d.getTime()) {
				time += d.getTime();
				if(queue.size() == 0) {
					sb.append(d.getName() + " " + time);
				}else {
					sb.append(d.getName() + " " + time + "\n");
				}

			}else {
				time += q;
				int res = d.getTime() - q;
				d.setTime(res);
				queue.add(d);
			}
		}
		System.out.println(sb.toString());
	}
}

class Data{
	String name;
	int time;
	public Data(String name, int time) {
		this.name = name;
		this.time = time;
	}
	public String getName() {
		return name;
	}
	public int getTime() {
		return time;
	}
	public void setTime(int time) {
		this.time = time;
	}
}