/*我在认为有问题的地方加了注释*/
#include
#include
#include
using namespace std;
long long g[300][300] = {0};
long long d[300][300] = {0};
char s[300];
int main(){
int n,K;
cin >> n >> K;
scanf("%s",s);
for (int i=1;i
for (int i=1;i
for (int j=1;j<=K;++j)
for (int k=1;kd[i][j] = max(d[i][j], d[k][j-1]*g[k+1][i]);
cout << d[n][K] << endl;
}