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 Main
{
    public static void main(String[] args)throws Exception
    {
        Scanner sc = new Scanner(System.in);
        Deque <String> que = new ArrayDeque <>(); 
        String []s = new String [2];  
        int n = sc.nextInt();
        int quan = sc.nextInt();
        for(int i = 0; i<n;i++) 
        {
            que.add(sc.next()+" "+sc.next());
        }
        Iterator itr = que.iterator();
        int time = 0;
        while(true)
        {
            try
            {
                s= que.getFirst().split(" ");
            }
            catch(NoSuchElementException e) 
            {
                break;
            }
            int num = Integer.parseInt(s[1]);
            if(num>quan) 
            {
                time =  quan + time;
                num = num-quan;
                que.removeFirst();
                que.add(s[0].concat(" "+ String.valueOf(num)));
            }
            else if (num<=quan)
            {
                time =  num + time;
                que.removeFirst();
                System.out.println(s[0]+" "+ time);
            }
        }
    }
}