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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String[] in = sc.nextLine().split(" ");

		int cut = Integer.parseInt(in[1]);
		Queue<Integer> qu = new LinkedList<Integer>();
		Queue<String> quname = new LinkedList<String>();
		for (int n = 0; n <Integer.parseInt(in[0]); n++) {
			String[] in2 = sc.nextLine().split(" ");
			quname.offer(in2[0]);
			qu.offer(Integer.parseInt(in2[1]));
			
		}
		
		int time = 0;
		while (!qu.isEmpty()) {
			String name=quname.poll();
			int n = qu.poll();
			if (n-cut > 0) {
				quname.offer(name);
				qu.offer(n-cut);
				
				time += cut;
			} else {				
				time += n;
				System.out.println(name+" "+time);
			}
		}
	}

}