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) {
		Queue<Integer> time = new LinkedList<Integer>();
		Queue<String> name = new LinkedList<String>();
		
		Scanner sc = new Scanner(System.in);
		int input = sc.nextInt();
		int quantum = sc.nextInt();
		int timestamp = 0;
		sc.nextLine();
		String p = "";
		int t = 0;
		for (int i =0; i< input; i++) { //////  p1 = p,    500 = t
		  p = sc.next();
		  name.add(p);
		  t = sc.nextInt();
		  time.add(t);

		}
		
		while(!name.isEmpty()) {
			String a = name.poll();
			int ti = time.poll();
			if( ti <= quantum) {
				timestamp += ti;
				System.out.println(a + " " + timestamp);
			
				
			}
			else {
				ti = ti - quantum;
				name.add(a);
				time.add(ti);
				timestamp += quantum;
			}
			
		}
	}
}