#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n, k;
    cin >> n >> k;

    string s;
    cin >> s;
    if(n == k){
        reverse(s.begin(),s.end());
        cout << s << "\n";
    }else {
        int x = n-k+1;
        rotate(s.begin(), s.begin()+(n-(x&1)-x/2*2), s.end()-(x&1));
        if(x&1){ // amari 1
            reverse(s.end()-k,s.end());
        }
        cout << s << "\n";
    }


    return 0;
}