高精度懒得写,用了万能的python。
m,n=map(int,input().split())
s=int('*'+input())
f=[[0 for i in range(m+1)] for j in range(n+1)]
for i in range(1,m+1):是左闭右开
f[0][i]=int(str(s)[1:i+1])
for i in range(1,m+1):#枚举后缀
for j in range(0,i):#枚举前缀
for k in range(1,n+1):#枚举星数
f[k][i]=max(f[k][i],f[k-1][j]*int(str(s)[j+1:i+1]))#前缀不能和后缀重合
print(f[n][m])