def main():
    n, k = map(int, input().split())
    s = list(input())
    ans = solve(n, k, s)
    print(ans)

def test():
    n, k = map(int, input().split())
    s = list(input())
    wj = solve(n, k, s)
    ac = guchoku(n, k, s)

    print('OK' if ac == wj else 'AC:{} WJ:{}'.format(ac, wj))

def guchoku(n, k, s):
    for i in range(n - k + 1):
        s = s[:i] + s[i:i + k][::-1] + s[i + k:]
    return ''.join(s)

def solve(n, k, s):
    if n == k:
        return ''.join(s[::-1])
    if k % 2:
        return ''.join(s[k - 1:] + s[:k -1])
    else:
        return ''.join(s[k - 1:] + s[:k -1][::-1])

if __name__ == '__main__':
    main()