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[]) {
		Scanner sc = new Scanner(System.in);
		String[] info = sc.nextLine().split(" ");
		Queue<Process> entries = new LinkedList<>();
		int size = Integer.parseInt(info[0]);
		int runtime = Integer.parseInt(info[1]);
		for(int i = 0; i < size; i++) {
			info = sc.nextLine().split(" ");
			entries.add(new Process(info[0], Integer.parseInt(info[1])));
		}
		sc.close();
		int totalTime = 0;
		while(entries.size() > 0) {
			Process temp = entries.remove();
			if(temp.getTime() > runtime) {
				totalTime += runtime;
				temp.setTime(temp.getTime() - runtime);
				entries.add(temp);
			}
			else {
				totalTime += temp.getTime();
				System.out.println(temp.getName() + " " + totalTime);
			}
		}
	}
}

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