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

Solution:
from collections import deque

n,q = map(int,input().split())
queue = deque([])

for i in range(n):
  name,time = input().split()
  time = int(time)
  queue.append([name,time])

t = 0
while len(queue) > 0:
  top = queue.popleft()
  spend = min(top[1], q)
  top[1] -= spend
  t += spend
  if top[1] == 0:
    print(top[0], t)
  else:
    queue.append(top)