#include<bits/stdc++.h> using namespace std; int l,n,c[105],a[105],g[105][105],dp[1005][1005]; int main(){ while(cin>>l){ if(l==0){ break; } scanf("%d",&n); for(int i=1; i<=n; i++) scanf("%d",&c[i]); for(int i=1;i<=n;i++){ a[i]=c[i]-c[i-1]; } a[n+1]=l-c[n]; for(int i=1;i<=n+1;i++)cout<<a[i]<<endl; sort(a+1,a+2+n,greater<int>()); for(int i=1; i<=n+1; i++) for(int j=i; j<=n+1; j++) g[i][j]=g[i][j-1]+a[j]; //g[i][j]初始化 for(int s=2; s<=n+1; s++) //s控制合并的宽度 for(int i=1,j=s; j<=n+1; i++,j++) //相同宽度的合并逐个进行 { dp[i][j]=1<<30; for(int k=i; k<j; k++) //k为切割点 dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+g[i][j]); } printf("The minimum cutting is %d\n",dp[1][n+1]); } }