#include <cstring>
#define N 505
using namespace std;
int dp[N][N], num[N][N];
char number[N];
int n, k;
int main() {
	scanf("%d%d", &n, &k);
	getchar();
	scanf("%s", number);
	for(int i = 0; i < n; i++)
		num[i+1][i+1] = number[i] - '0';
	for(int j = 2; j <= n; j++) {
		for(int i = j-1; i >= 1; i--)
			num[i][j] = num[i][j-1] * 10 + num[j][j];
	}
	for(int i = 1; i <= n; i++)
		dp[i][0] = num[1][i];
	for(int l = 1; l <= k; l++) {
		for(int i = l+1; i <= n; i++) {
			for(int j = l; j <= i-1; j++)
				dp[i][l] = max(dp[i][l], dp[j][l-1] * num[j+1][i]);
		}
	}
	cout<<dp[n][k];
	return 0;
}/*
4 2
1231

answer:62
*/

为什么只有20tps