#include <bits/stdc++.h>
#define INF (1LL<<60)
#define MOD7 1000000007LL
#define PREP(i, s, x) for(ll i = (s); i < (x); i ++)
#define MREP(i, s, x) for(ll i = (s); i >= (x); i --)
#define REP(i, x) PREP(i, 0, x)
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return 1;}return 0;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return 1;}return 0;}
ll llpow(ll a, ll n){ll res=1;REP(_,n){res*=a;}return res;}

int main(){
    ll n, k;
    string s;
    cin >> n >> k >> s;
    if(n == k){
        reverse(s.begin(), s.end());
        cout << s << endl;
        return 0;
    }
    string ss = s.substr(k - 1, n - k + 1);
    string tt = s.substr(0, k - 1);
    if((n - k + 1) % 2 == 1){
        reverse(tt.begin(), tt.end());
    }
    cout << ss << tt << endl;
    return 0;
}