#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

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