Takahashi has a string S of length N consisting of lowercase English letters. On this string, he will perform the following operation K times:

* Let T be the string obtained by reversing S, and U be the string obtained by concatenating S and T in this order.
* Let S' be some contiguous substring of U with length N, and replace S with S'.



Among the strings that can be the string S after the K operations, find the lexicographically smallest possible one.

Constraints

* 1 \leq N \leq 5000
* 1 \leq K \leq 10^9
* |S|=N
* S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


N K
S


Output

Print the lexicographically smallest possible string that can be the string S after the K operations.

Examples

Input

5 1
bacba


Output

aabca


Input

10 2
bbaabbbaab


Output

aaaabbaabb
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
const int N=5005;
int n,k;string s,ans;
string rev(string str){
	reverse(str.begin(),str.end());
	return str;
}
int main(){
	scanf("%d%d",&n,&k),cin>>s;
	char ch=*min_element(s.begin(),s.end());
	if(k>=14){rep(i,1,n)putchar(ch);puts("");return 0;}
	while(k--){
		s+=rev(s);
		if(!k){
			ans="";
			rep(i,0,n)if(s[i]==ch){
				string t=s.substr(i,n);
				if(ans==""||t<ans){
					ans=t;
				}
			}
			cout<<ans<<endl;
		}else{
			ans="";
			rep(i,0,n)if(s[i]==ch){
				string t=s.substr(i,n);
				if(ans==""||t<ans){
					ans=t;
				}
			}
			s=rev(ans);
		}
	}
	return 0;
}