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;
class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int q = sc.nextInt();

    int s = 0;
    int g = n-1;

    int tt = 0;

    String[] name = new String[n];
    int[] time = new int[n];

    for(int i=0; i<n; i++){
      name[i] = sc.next();
      time[i] = sc.nextInt();
    }

    while(true){
      if(time[s] > q){
        time[(g+1)%n] = time[s]-q;
        name[(g+1)%n] = name[s];
        tt = tt+q;
        g = (g+1)%n;
        s = (s+1)%n;
      }
      else{
        tt = tt+time[s];
        if(s == g){
          System.out.println(name[s]+" "+tt);
          break;
        }
        else{
          System.out.println(name[s]+" "+tt);
          s = (s+1)%n;
        }
      }
    }

  }
}