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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
typedef struct{
  string name;
  int time;
}P;

int main(){
  int n,t;
  queue<P>que;    //キュー♂♂♂♂♂♂♂♂♂♂
  string name;
  int time;
  cin >> n >> t;
  for(int i = 0;i < n;i++){
    cin >> name >> time;
    que.push((P){name,time});
  }
  int cnt = 0;
  while(!que.empty()){
    name = que.front().name;
    time = que.front().time;
    que.pop();
    cnt += min(t,time);
    time -= t;
    if(time <= 0)cout << name << " " << cnt << endl;
    else que.push((P){name,time});
  }
  return 0;
}