#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
 
const int mx=100010;
const ll mod=1e9+7;

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