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) {
		// TODO Auto-generated method stub

		Scanner scan=new Scanner(System.in);
		int n=scan.nextInt();
		int tm=scan.nextInt();
		String stmp=scan.nextLine();
		Queue<Integer> q=new LinkedList<>();
		Queue<String> qstr=new LinkedList<>();
		
		for(int i=0;i<n;i++){
			String string=scan.nextLine();
			String[] str=string.split(" ");
			qstr.offer(str[0]);
			q.offer(Integer.parseInt(str[1]));
		}
		int round=0;
		int sum=0;
		while(!q.isEmpty()){
			int tmp=q.poll();
			if(tmp<=tm){
				sum+=tmp;
				System.out.print(qstr.poll()+" ");
				//System.out.println(round*tm+tmp%tm-com);
				System.out.println(sum);
			}
			else {
				q.offer(tmp-tm);
				qstr.offer(qstr.poll());
				sum+=tm;
			}
			round++;
		}
	}

}