#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int main(void)
{
    int N, K;
    cin >> N >> K;
    string s;
    cin >> s;
    int x = N - K + 1;
    for (int i = K - 1; i < N; i++)
    {
        cout << s[i];
    }
    for (int i = K - 2; i >= 0; i--)
    {
        cout << s[i];
    }
    return 0;
}