#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;

vector<ll>r[100010];
ll rd[100010];
int main(void){
    ll n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    if(k==s.length()){
        for(int i=0;i<n;i++)cout<<s[n-1-i];
        cout<<endl;
    }
    else{
        for(int i=k-1;i<n;i++)cout<<s[i];
        for(int i=0;i<k-1;i++)cout<<s[i];
        cout<<endl;
    }
    return 0;
}