1992

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
using namespace std;

const int maxn=505;
int b[maxn],dp[maxn][maxn],sum[maxn];

int DP(int m,int k)
{
    int i,j,x,y;
    for(i=2;i<=k;i++){
        for(j=i;j<=m;j++){
            dp[i][j]=INT_MAX;
            for(x=j-i+1;x>0;x--){
                dp[i][j]=min(dp[i][j],max(dp[i-1][j-x],sum[j]-sum[j-x]));
            }
        }
    }
    return dp[k][m];
}


int main()
{
    int m,k,cas=0;
    while(scanf("%d %d",&m,&k)==2){
        b[0]=0;
        sum[0]=0;
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i]);
            sum[i]=sum[i-1]+b[i];
            dp[1][i]=sum[i];
        }
        printf("Case %d: %d
",++cas,DP(m,k));
    }
    return 0;
}