#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    srep(i,k-1,n)cout << s[i];
    if((n - k + 1) % 2 == 0){
        rep(i,k-1)cout << s[i];
    }else{
        drep(i,k-1)cout << s[i];
    }
    cout << endl;
    return 0;
}