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.LinkedList;

public class Main{
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int num = in.nextInt();
		int timeRestriction = in.nextInt();
		int currentTime = 0;
		LinkedList<RRSHelper> schedule = new LinkedList<RRSHelper>();
		for(int i = 0; i < num; i++) {
			schedule.add(new RRSHelper(in.next(), in.nextInt()));
		}
		in.close();
		RRSHelper temp = new RRSHelper();
		while(!schedule.isEmpty()) {
			if(schedule.peek().timeCheck() <= timeRestriction) {
				temp = schedule.remove();
				currentTime = currentTime + temp.timeCheck();
				temp.setTime(currentTime);
				System.out.println(temp);
			} else {
				temp = schedule.remove();
				currentTime = currentTime + timeRestriction;
				temp.subTime(timeRestriction);
				schedule.add(temp);
			}
		}
	}
}

class RRSHelper {
	String name;
	int timeleft;
	public RRSHelper(String x, int y) {
		name = x;
		timeleft = y;
	}
	public RRSHelper() {
	}
	
	public void addTime(int x) {
		timeleft = timeleft + x;
	}
	public void subTime(int x) {
		timeleft = timeleft - x;
	}
	public void setTime(int x) {
		timeleft = x;
	}
	public int timeCheck() {
		return timeleft;
	}
	public String toString() {
		return name + " " + timeleft;
	}
	
}