#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;



int main()
{
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    string ans;
    rep(i, 0, n-k+1){
        ans.push_back(s[k-1+i]);
    }
    if((n-k+1) % 2 == 0){
        rep(i, 0, k-1){
            ans.push_back(s[i]);
        }
    }else{
        string b;
        rep(i, 0, k-1){
            b.push_back(s[i]);
        }
        reverse(b.begin(), b.end());
        ans += b;
    }
    cout << ans << endl;
    return 0;
}