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

public class Main {
  public static void main(String[] args) {
    try (Scanner sc = new Scanner(System.in)) {
      Queue<Prosess> queue = new ArrayDeque<>();
      int N = sc.nextInt();
      int q = sc.nextInt();
      int time = 0;

      for (int i = 0; i < N; i++) {
        queue.offer(new Prosess(sc.next(), sc.nextInt()));
      }

      while (queue.size() != 0) {
        Prosess p = queue.poll();
        if (p.time > q) {
          // クオンタムだけ処理
          queue.offer(new Prosess(p.name, p.time - q));
          time += q;
        } else {
          // 処理が終わっていれば、名前とここまでかかった時間を表示して終わり
          time += p.time;
          System.out.println(p.name + " " + time);
        }

      }
    }
  }
}

class Prosess {
  String name;
  int time;

  Prosess(String name, int time) {
    this.name = name;
    this.time = time;
  }
}