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

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String input = in.nextLine();
		Scanner setsinput = new Scanner(input);
		int n = setsinput.nextInt();
		int quantum_time = setsinput.nextInt();
		Queue<Process> q = new ArrayDeque<Process>();
		for(int i = 0; i < n; i++) {
			String setsStr = in.nextLine();
			//System.out.println(setsStr.charAt(0));
			Scanner setsLine = new Scanner(setsStr);
			q.add(new Process(setsLine.next(),setsLine.nextInt()));
		}
		
		Process tmp = new Process();
		StringBuilder ans = new StringBuilder();
		int total_time = 0;
		
		while (!q.isEmpty()) {
			tmp = q.peek();
			q.poll();
			if(tmp.get_time() <= quantum_time) {
				total_time += tmp.get_time();
				ans.append(tmp.get_Name()).append(" ").append(Integer.toString(total_time)).append("\n");
			}else {
				total_time += quantum_time;
				q.add(new Process(tmp.get_Name(), tmp.get_time() - quantum_time));
			}
		}
		System.out.print(ans.toString());
	}
}

class Process {
	String name;
	int time;
	
	Process(){
		
	}
	
	Process(String init_name, int init_time){
		name = init_name;
		time = init_time;
	}
	
	public String get_Name() {
		return name;
	}
	
	public int get_time() {
		return time;
	}
	
}