#include <map>

#include <set>

#include <list>

#include <cmath>

#include <queue>

#include <stack>

#include <cstdio>

#include <vector>

#include <string>

#include <cctype>

#include <complex>

#include <cassert>

#include <utility>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

using namespace std;

typedef pair<int,int> PII;

typedef long long ll;

#define lson l,m,rt<<1

#define pi acos(-1.0)

#define rson m+1,r,rt<<11

#define All 1,N,1

#define read freopen("in.txt", "r", stdin)

const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;

const int INF= 0x7ffffff;

const int mod =  ;

int dp[][],c[],n,l;

void solve(){

    c[]=;

    c[n+]=l;

    memset(dp,,sizeof(dp));

    for(int p=;p<=n+;++p)

        for(int i=;i<=n-p+;++i)

    {

        int j=i+p;

        dp[i][j]=INF;

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

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

    }

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

}

int main()

{

    while(~scanf("%d",&l)){

        if(l==)break;

        scanf("%d",&n);

        for(int i=;i<=n;++i)

            scanf("%d",&c[i]);

        solve();

    }

return ;

}