def reverse(first, end, l):
    if end - first == 1:
        middle = 1
    else:
        middle = (first + end) // 2

    for index, val in enumerate(range(first, middle)):
        tmp = l[val]
        l[val] = l[end - index]
        l[end - index] = tmp

N, K = map(int, input().split())
l = list(input())

for i in range(1, N - K + 1 + 1):
    reverse(i - 1, i + K - 1 - 1, l)

s = ''
for i in l:
    s += i

print(s)