#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip> //cout << fixed << setprecision(15) << x << endl;

using namespace std;
typedef long long ll;
const ll INF = 1e9 + 8;
const ll MOD = 1e9 + 7;
const ll LLINF = 1e18;
#define Pint pair<int, int>
#define rng(i, a, b) for(int i = int(a); i < int(b); i++)
#define rnr(i, a, b) for(int i = int(a); i >= int(b); i--)
#define rep(i, b) rng(i, 0, b)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
/* -- template -- */

int main() {
    int n, k; cin >> n >> k;
    string s; cin >> s;
    string ans = "";
    for(int i = k - 1; i < n; ++i) {
        ans += s[i];
    }
    if((n - k + 1) % 2 == 0) {
        for(int i = 0; i < k - 1; ++i) {
            ans += s[i];
        }
    } else {
        for(int i = k - 2; i >= 0; --i) {
            ans += s[i];
        }
    }

    cout << ans << endl;
}