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.Scanner;
import java.util.ArrayDeque;
import java.util.Deque;
 
 
class Main {
  public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int n = scan.nextInt();
    int q = scan.nextInt();

    Deque<deque> d = new ArrayDeque<deque>();

    for(int i = 0; i < n; ++i) {
        String name = scan.next();
        int time = scan.nextInt();
        d.add(new deque(name, time));
    }
     
    int elapsed = 0;
    while(!d.isEmpty()){
         deque p = d.removeFirst();
         if(p.time > q) {
            elapsed += q;
            d.add(new deque(p.name, p.time - q));
         }else{
            elapsed += p.time;
            System.out.println(p.name + " "  + elapsed);
         }
    }
  }
}
 
class deque {
    public String name;
    public int time;
    public deque(String n, int t) {
        name = n;
        time = t;
    }
 }