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;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		int n, q, sum = 0, num = 0;
		int[] time, end;
		String[] name;
		
		n = scan.nextInt();
		q = scan.nextInt();

		time = new int[n];
		end = new int[n];
		name = new String[n];
		
		for(int i = 0; i < n; i++) {
			name[i] = scan.next();
			time[i] = scan.nextInt();
		}
		
		while(num < n) {
			for(int i = 0; i < n; i++) {
				if(time[i] > 0) {
					if(time[i] <= q) {
						sum += time[i];
						end[num] = i;
						num++;
						time[i] = -sum;
						
					} else {
						time[i] -= q;
						sum += q;
						
					}
				}
			}
		}
		
		for(int i = 0; i < n; i++) {
			System.out.println(name[end[i]] + " " + -time[end[i]]);
		}
		
		scan.close();
	}
}