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.*;
class Process{
    public String name;
    public int time;
    public String getName(){
	return this.name;
    }
    public int getTime(){
	return this.time;
    }
}
class Main{

    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int n = sc.nextInt(),q = sc.nextInt();
	int ttltime = 0;
	
        ArrayList<Process> p = new ArrayList<Process>();
	
	for(int i = 0;i < n;i++){
	    Process ptmp = new Process();
	    ptmp.name = sc.next();
	    ptmp.time = sc.nextInt();
	    p.add(ptmp);
	}
	
	while(p.size() > 0){
	    int T = p.get(0).getTime();
	    Process ptmp2 = new Process();
	    ptmp2.name = p.get(0).getName();
	    if(T > q){
		p.remove(0);
		ptmp2.time = T - q;
		p.add(ptmp2);
		ttltime += q;
	    }
	    else{
		ttltime += T;
		System.out.println(p.get(0).getName()+" "+ttltime);
		p.remove(0);
	    }    
	}
       
    }

}