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.Deque;
import java.util.ArrayDeque;

class Main {
  public static void main(String... args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int q = sc.nextInt();
    Deque<String> names = new ArrayDeque<String>(50000);
    Deque<Integer> times = new ArrayDeque<Integer>(50000);

    for (int i = 0; i < n; i++) {
      names.offerLast(sc.next());
      times.offerLast(sc.nextInt());
    }

    execution(q, names, times);
  }

  public static void execution(int q, Deque<String> names, Deque<Integer> times) {
    int time;
    String name;
    int currentTime = 0;

    while(true) {
      try {
        name = names.removeFirst();
        time = times.removeFirst();

        if (time - q <= 0) {
          currentTime += time;
          System.out.println(name + " " + currentTime);
          continue;
        }

        time -= q;
        currentTime += q;

        names.offerLast(name);
        times.offerLast(time);

      } catch (Exception e) {
        break;
      }
    }
  }
}