#include //#include #include #include #define rep(i, n) for(int i = 0; i < (n); i++) #define rrep(i, n) for(int i = (n-1); i >= 0; i--) using namespace std; using namespace atcoder; typedef long long ll; const int MOD = 1000000007; //const int MOD = 998244353; const ll INF = 1LL<<61; const int IINF = 1000000000; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } typedef pair PI; typedef pair P; typedef pair PS; using mint = modint1000000007; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int N, K; cin >> N >> K; string S; cin >> S; if(N == K){ reverse(S.begin(), S.end()); cout << S << endl; return 0; } int n = N - K + 1; int remain = N - n; string ans = ""; for(int i = remain; i < N; i++){ ans += S[i]; } for(int i = 0; i < remain; i++){ ans += S[i]; } cout << ans << endl; }