#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>

using ll = long long;
using namespace std;

constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;

int main(void) {
	int n, k;
	string s;
	cin >> n >> k >> s;
	
	k--;
	string ans = s.substr(k, n - k);
	string tmp = s.substr(0, k);
	
	if( (n - k) % 2 == 1 ) reverse(tmp.begin(), tmp.end());
	
	ans += tmp;
	cout << ans << endl;
	
	return 0;
}