Efim just received his grade for the last test. He studies in a special school and his grade can be equal to any positive decimal fraction. First he got disappointed, as he expected a way more pleasant result. Then, he developed a tricky plan. Each second, he can ask his teacher to round the grade at any place after the decimal point (also, he can ask to round to the nearest integer). 

There are t seconds left till the end of the break, so Efim has to act fast. Help him find what is the maximum grade he can get in no more than t seconds. Note, that he can choose to not use all t seconds. Moreover, he can even choose to not round the grade at all.

In this problem, classic rounding rules are used: while rounding number to the n-th digit one has to take a look at the digit n + 1. If it is less than 5 than the n-th digit remain unchanged while all subsequent digits are replaced with 0. Otherwise, if the n + 1 digit is greater or equal to 5, the digit at the position n is increased by 1 (this might also change some other digits, if this one was equal to 9) and all subsequent digits are replaced with 0. At the end, all trailing zeroes are thrown away.

For example, if the number 1.14 is rounded to the first decimal place, the result is 1.1, while if we round 1.5 to the nearest integer, the result is 2. Rounding number 1.299996121 in the fifth decimal place will result in number 1.3.


-----Input-----

The first line of the input contains two integers n and t (1 ≤ n ≤ 200 000, 1 ≤ t ≤ 10^9) — the length of Efim's grade and the number of seconds till the end of the break respectively.

The second line contains the grade itself. It's guaranteed that the grade is a positive number, containing at least one digit after the decimal points, and it's representation doesn't finish with 0.


-----Output-----

Print the maximum grade that Efim can get in t seconds. Do not print trailing zeroes.


-----Examples-----
Input
6 1
10.245

Output
10.25

Input
6 2
10.245

Output
10.3

Input
3 100
9.2

Output
9.2



-----Note-----

In the first two samples Efim initially has grade 10.245. 

During the first second Efim can obtain grade 10.25, and then 10.3 during the next second. Note, that the answer 10.30 will be considered incorrect.

In the third sample the optimal strategy is to not perform any rounding at all.

Difficulty: MEDIUM_HARD

Solutions:
import math, sys, bisect, heapq
from collections import defaultdict, Counter, deque
from itertools import groupby, accumulate
int1 = lambda x: int(x) - 1
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda : map(int, input().split())
alele = lambda : list(map(int, input().split()))
ilelec = lambda : map(int1, input().split())
alelec = lambda : list(map(int1, input().split()))

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def Y(c):
	print(['NO', 'YES'][c])

def y(c):
	print(['no', 'yes'][c])

def Yy(c):
	print(['No', 'Yes'][c])
(n, t) = ilele()
num = input()
(a, b) = num.split('.')
Ans = [a]
Ans.append('.')

def fun():
	x = ['0'] + [*a]
	for i in range(len(x) - 1, -1, -1):
		if x[i] == '9':
			x[i] = '0'
		else:
			x[i] = str(int(x[i]) + 1)
			break
	if x[0] == '0':
		for i in range(1, len(x)):
			print(x[i], end='')
	else:
		print(''.join(x))
for i in b:
	Ans.append(i)
	if int(i) >= 5:
		if Ans[-1] == '.':
			fun()
			exit(0)
		else:
			while t > 0:
				t -= 1
				if Ans[-1] == '.':
					fun()
					exit(0)
				if int(Ans[-1]) >= 5:
					Ans.pop()
					if Ans[-1] == '.':
						fun()
						exit(0)
					else:
						Ans[-1] = str(int(Ans[-1]) + 1)
				else:
					break
		break
print(''.join(Ans))


(n, t) = map(int, input().split())
mark = input().split('.')
shift = False
fraction = []
for digit in map(int, mark[1]):
	if digit > 4:
		t -= 1
		if fraction:
			fraction[-1] += 1
			while t and fraction and (fraction[-1] > 4):
				t -= 1
				fraction.pop()
				if fraction:
					fraction[-1] += 1
				else:
					shift = True
		else:
			shift = True
		break
	fraction.append(digit)
if shift:
	last_digits = [int(mark[0][-1]) + 1]
	i = -1
	while last_digits[-1] > 9:
		last_digits[-1] -= 10
		i -= 1
		if -i <= len(mark[0]):
			last_digits.append(int(mark[0][i]) + 1)
		else:
			last_digits.append(1)
	print(mark[0][:i], *last_digits[::-1], sep='', end='')
else:
	print(mark[0], end='')
if fraction:
	print('.', *fraction, sep='')


def main():
	(n, t) = map(int, input().split())
	b = input()
	p = b.find('.')
	for i in range(p + 1, n):
		if b[i] > '4':
			break
	else:
		print(b)
		return
	while t:
		i -= 1
		t -= 1
		if b[i] < '4':
			break
	if i > p:
		print(b[:i], chr(ord(b[i]) + 1), sep='')
	else:
		k = list(b[:i])
		for x in range(len(k) - 1, -1, -1):
			if k[x] == '9':
				k[x] = '0'
			else:
				k[x] = chr(ord(k[x]) + 1)
				break
		else:
			k.insert(0, '1')
		print(''.join(k))
main()


from sys import *
input = stdin.readline
(n, t) = map(int, input().split())
num = input()
idx = num.find('.')
if idx < 0:
	print(num)
	exit()
cnt = 1
for i in range(idx + 1, n):
	if num[i] < '5':
		if 5 - int(num[i]) == 1:
			cnt += 1
		else:
			cnt = 1
	if num[i] >= '5':
		j = min(cnt, t)
		if num[i - j] != '.':
			num = num[:i - j] + str(int(num[i - j]) + 1)
		else:
			curr = 0
			while num[idx - curr - 1] == '9' and idx - curr != 0:
				curr += 1
			num = num[:idx - curr - 1] + str(int(num[idx - curr - 1]) + 1) + '0' * curr if curr != idx else '1' + '0' * curr
		break
print(num)


(n, t) = list(map(int, input().split()))
num = input()
idx = num.index('.')
cnt = 1
for i in range(idx + 1, n):
	if num[i] < '5':
		if 5 - int(num[i]) == 1:
			cnt += 1
		else:
			cnt = 1
	if num[i] >= '5':
		j = min(cnt, t)
		if num[i - j] != '.':
			num = num[:i - j] + str(int(num[i - j]) + 1)
		else:
			curr = 0
			while num[idx - curr - 1] == '9' and idx - curr != 0:
				curr += 1
			num = num[:idx - curr - 1] + str(int(num[idx - curr - 1]) + 1) + '0' * curr if curr != idx else '1' + '0' * curr
		break
print(num)


(a, b) = map(int, input().split())
c = input()
clock = c.find('.')
for x in range(clock + 1, a):
	if c[x] > '4':
		break
else:
	x = a
	print(c)
if x != a:
	while b:
		x -= 1
		b -= 1
		if c[x] != '4':
			break
	if x > clock:
		print(c[:x], chr(ord(c[x]) + 1), sep='')
	else:
		c = list(c[:x])
		x -= 1
		while x >= 0:
			if c[x] == '9':
				c[x] = '0'
				x -= 1
			else:
				c[x] = chr(ord(c[x]) + 1)
				break
		else:
			c.insert(0, '1')
		print(''.join(c))


__author__ = 'Think'

def plus(s, n=1):
	if len(s) > n:
		route = s[-n] == '9' or (s[-1 - n] == '9' and s[-n] == '.')
	else:
		route = s[-n] == '9'
	if route:
		s = s[:-n] + s[-n]
		broken = False
		count = 0
		passed = False
		for i in range(len(s) - 1, -1, -1):
			if s[i] == '.':
				passed = True
			elif s[i] == '9':
				if passed:
					count += 1
			else:
				broken = True
				break
		if not broken:
			return '1' + '0' * count
		else:
			return s[:i] + chr(ord(s[i]) + 1) + '0' * count
	else:
		if s[-n] == '.':
			n += 1
		return s[:-n] + chr(ord(s[-n]) + 1)
(n, t) = [int(i) for i in input().split()]
default = input()
(new, frac) = default.split('.')
new += '.'
fours = False
done = False
for i in range(len(frac)):
	s = frac[i]
	if ord(s) > 52:
		if not fours:
			print(plus(new))
		else:
			print(plus(new, min(t, counter + 1)))
		done = True
		break
	elif ord(s) == 52:
		if not fours:
			fours = True
			counter = 0
		counter += 1
	elif fours:
		fours = False
	new += s
if not done:
	print(default)


R = lambda : map(int, input().split())
(n, t) = R()
s = list(input())
r = -1
l = s.index('.') + 1
for i in range(l, n):
	if s[i] >= '5':
		r = i
		break
for i in range(r, max(l - 1, r - t), -1):
	if s[i] >= '5':
		if i - 1 != l - 1:
			s[i - 1] = str((int(s[i - 1]) + 1) % 10)
			r = i - 1
		else:
			s[i - 2] = str((int(s[i - 2]) + 1) % 10)
			r = l - 2
			if s[r] == '0':
				for j in range(r - 1, -1, -1):
					if s[j] == '9':
						s[j] = '0'
					else:
						s[j] = str((int(s[j]) + 1) % 10)
						break
				if s[0] == '0':
					s = ['1'] + s
					r += 1
print(''.join(s[:r + 1]) if r >= 0 else ''.join(s))


import sys
from decimal import *
(n, t) = map(int, input().split())
x = input()
i = x.find('.')
if 0 > i:
	print(x)
	sys.exit()
if 1 > i:
	i = 1
	n += 1
	x = '0' + x
for j in range(1 + i, n):
	if '4' < x[j]:
		break
else:
	print(x)
	sys.exit()
while 0 < t:
	j -= 1
	if '4' != x[j]:
		break
	t -= 1
getcontext().prec = 1 + j
x = pow(Decimal(10), i - j) + Decimal(x[:1 + j])
print(x if x != x.to_integral_value() else x.quantize(Decimal(1)))


(n, t) = [int(x) for x in input().split()]
(a, s) = input().split('.')
s = list(s)
pos = len(s) - 1
for i in range(len(s)):
	if ord(s[i]) > ord('4'):
		pos = i
		break
while t > 0 and pos > 0:
	if ord(s[pos]) > ord('4'):
		pos -= 1
		s[pos] = chr(ord(s[pos]) + 1)
		t -= 1
	else:
		break
if t > 0 and pos == 0 and (s[0] > '4'):
	it = len(a) - 1
	A = [ord(ch) - ord('0') for ch in a]
	A[it] += 1
	while it > 0:
		if A[it] == 10:
			A[it] = 0
			A[it - 1] += 1
			it -= 1
		else:
			break
	res = ''.join([str(x) for x in A])
	print(res)
else:
	res = a + '.' + ''.join(s[:pos + 1])
	print(res)