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 <String> N = new LinkedList<>();
		Queue <Integer> Q = new LinkedList<>();
        Scanner sc = new Scanner(System.in);
        
        int n = sc.nextInt();
		int task = sc.nextInt();	

		for(int i = 0; i < n; i++) {
			N.add(sc.next());
			Q.add(sc.nextInt());
		}
		sc.close();
		
		Queue <String> N_ans = new LinkedList<>();
		Queue <Integer> Q_ans = new LinkedList<>();
		
		
		int time = 0;
		int R = 0;
		String S = "";
		while (!Q.isEmpty()) {
			R = Q.poll();
			S = N.poll();
			if (R>task){
				R-=task;
				Q.add(R);
				N.add(S);
				time+=task;
			}
			else {
				time+=R;
				Q_ans.add(time);
				N_ans.add(S);
			}
		}
		for(int i = 0; i < n; i++) {
			System.out.print(N_ans.poll() + " ");
			System.out.println(Q_ans.poll());
		}
	}

}