#include "bits/stdc++.h"usingnamespacestd;
int Ans, n, k;
char s[50];
void Dfs(int Used, int Start, int CurSum) {
if (Used >= k) {
int Num = 0;
for (int i = Start; i < n; ++i)
Num = Num * 10 + s[i] - '0';
Ans = max(Ans, CurSum * Num);
return;
}
for (int i = Start + 1; i < n; ++i) {
int Num = 0;
for (int u = Start; u < i; ++u)
Num = Num * 10 + s[u] - '0';
Dfs(Used + 1, i, CurSum * Num);
}
}
int main() {
scanf("%d%d", &n, &k);
scanf("%s", s);
Dfs(0, 0, 1);
printf("%d\n", Ans);
return0;
}