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.Scanner;



public class Main{
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		LinkedList<String> qName = new LinkedList<>();
		LinkedList<Integer> qTime = new LinkedList<>();
		
		int amount = in.nextInt();
		int quantum = in.nextInt();
		for(int i= 0; i < amount; i++) 
		{
			qName.addLast(in.next());
			qTime.addLast(in.nextInt());
		}

		int time = 0;
		while(qName.size() != 0)
		{
			String cName = qName.removeFirst();
			int cTime = qTime.removeFirst();
			if(cTime > quantum)
			{
				time = time + quantum;
				cTime = cTime - quantum;
				
				qName.addLast(cName);
				qTime.addLast(cTime);
			}else
			{
				time = time + cTime;
				System.out.println(cName + " " + time);
			}
		}
	}

	
}