#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;
    rep(i, 0, n-k+1){
        reverse(s.begin()+i, s.begin() + i+k);
        //cout << s << endl;
    }
    cout << s << endl;
    return 0;
}