#include #define rep(i,n) for (int i = 0; i < n; ++i) #define ALL(c) (c).begin(), (c).end() #define SUM(x) std::accumulate(ALL(x), 0LL) #define MIN(v) *std::min_element(v.begin(), v.end()) #define MAX(v) *std::max_element(v.begin(), v.end()) #define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end()) using namespace std; typedef long long ll; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } const int INF = 1e9; const long long INFL = 1LL<<60; const int mod = 1000000007; int main() { int n, k; string s; cin >> n >> k >> s; string ans(n, 'x'); for (int i = 0; i < n - k + 1; i++) { ans[i] = s[i+k-1]; } for (int i = n - k + 1; i < n; i++) { ans[i] = s[i - n + k - 1]; } cout << ans << endl; return 0; }