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

Solution:
#!/usr/bin/env python
#-*- coding:utf-8 -*-
from collections import deque

def process_task(task,qua, elapsed_time, complete_task):
	exe_task = task.popleft()
	t = int(exe_task[1])
	q = int(qua)

	if t-q  > 0:
		exe_task[1] = (t - q)
		task.append(exe_task)
		elapsed_time += q
	else:	
		elapsed_time += t
		complete_task.append([exe_task[0], elapsed_time])

	return elapsed_time,complete_task

def main():
	n,q = map(int, raw_input().split())
	task = [raw_input().split() for _ in range(n)]
	que = deque(task)
	ela_time = 0
	comp_task = []

	while len(que) != 0:
		ela_time , comp_task= process_task(que, q, ela_time,comp_task)	

	for i in comp_task:
		print i[0], i[1]

#def test():

if __name__ == '__main__':
	main()
	#test()