Problem:
There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.

For example, we have the following queue with the quantum of 100ms.

A(150) - B(80) - C(200) - D(200)

First, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).

B(80) - C(200) - D(200) - A(50)

Next, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.

C(200) - D(200) - A(50)

Your task is to write a program which simulates the round-robin scheduling.

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.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 1000

1 ≤ timei ≤ 50000

1 ≤ length of namei ≤ 10

1 ≤ Sum of timei ≤ 1000000

Sample Input 1

5 100
p1 150
p2 80
p3 200
p4 350
p5 20

Sample Output 1

p2 180
p5 400
p1 450
p3 550
p4 800

Notes

Template in C

Solution in JAVA (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

class Main{

	public static void main(String[] args) {

		List<Integer> time=new ArrayList<Integer>();		//キューの処理にかかる時間
		List<String> cue_nm=new ArrayList<String>();
		BufferedReader bfr=new BufferedReader(new InputStreamReader(System.in));
		String moto="";
		StringTokenizer stk;
		int cue_su=0;		//もともと与えられたキュー数
		int jikan=0;		//現在の経過時間
		int quantum=0;		//キューの処理時間制限
		int que_zanryo=0;	//キューの残数

		String name="";				//変数保管用
		int suuji=0;
		boolean end=false;

		try {
			moto=bfr.readLine();
			stk=new StringTokenizer(moto, " ");
			cue_su=Integer.parseInt(stk.nextToken());
			quantum=Integer.parseInt(stk.nextToken());

			que_zanryo=cue_su;

			for(int i=0; i<cue_su; i++) {
				moto=bfr.readLine();
				stk=new StringTokenizer(moto," ");
				name=stk.nextToken();
				suuji=Integer.parseInt(stk.nextToken());

				if(suuji>quantum) {
					time.add(suuji-quantum);
					cue_nm.add(name);
					jikan+=quantum;
				}
				else {
					//リストにはついかしない
					jikan+=suuji;
					System.out.println(name+" "+jikan);
				}
			}

			while(true) {
				name=cue_nm.get(0);
				suuji=time.get(0);

				if(suuji>quantum) {
					jikan+=quantum;
					suuji=suuji-quantum;
					cue_nm.remove(0);
					time.remove(0);
					cue_nm.add(name);
					time.add(suuji);
				}
				else {
					jikan+=suuji;
					cue_nm.remove(0);
					time.remove(0);
					System.out.println(name+" "+jikan);
				}

				if(cue_nm.size()<=0) {
					System.exit(0);
				}

				else {
					end=false;
				}
			}

		}catch(IOException e) {
			System.exit(0);
		}
		catch(IndexOutOfBoundsException e) {
			System.exit(0);
		}
	}
}