#include<bits/stdc++.h> //变量不要取成ignore left之类

using namespace std;

const int maxn = ;

int cut[maxn];

int dp[maxn][maxn];

const int INF = 0x3fffffff;

int main()

{

    //freopen("in.txt","r",stdin);

    int L,n;

    while(scanf("%d",&L),L){

        scanf("%d",&n);

        cut[] = ; cut[n+] = L;

        for(int i = ; i <= n; i++) scanf("%d",cut+i);

        for(int i = ; i <= n; i++) dp[i][i+] = ;

        for(int d = ; d <= n; d++){

            for(int i = ,mi = n-d; i <= mi; i++){

                int j = i+d+;

                dp[i][j] = INF;

                for(int k = i+; k < j; k++){

                    dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);

                }

                dp[i][j] += cut[j]-cut[i];

            }

        }

        printf("The minimum cutting is %d.\n",dp[][n+]);

    }

    return ;

}