#include <iostream>
#include <cstring>
using namespace std ;
const int N=60,inf=1<<30;
int n,L,a[N],vis[N][N],f[N][N];
int dp(int l,int r){
if(l>=r-1) return 0;
if(vis[l][r]) return f[l][r];
vis[l][r]=1;
f[l][r]=inf;
for(int k=l+1;k<r;k++)
f[l][r]=min(f[l][r],dp(l,k)+dp(k,r)+a[r]-a[l]);
return f[l][r];
}
int main(){
while(cin>>L,L){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
a[0]=0,a[n+1]=L;
memset(vis,0,sizeof vis),memset(f,0,sizeof f);
printf("The minimum cutting is %d.\n",dp(0,n+1));
}
}