Chopsticks

#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 =  1000000007;
int dp[5010][1010];
int l[5010];
int n,k;
void solve(){
   for(int i=1;i<=n;++i){
    dp[i][0]=0;
    for(int j=1;j<=k;++j)
        dp[i][j]=INF;
   }
    for(int i=3;i<=n;++i)
        for(int j=1;j<=k;++j)
            if(i>=3*j&&dp[i-2][j-1]!=INF){
        dp[i][j]=min(dp[i-1][j],dp[i-2][j-1]+(l[i]-l[i-1])*(l[i]-l[i-1]));
            }
    printf("%d\n",dp[n][k]);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&k,&n);
        for(int i=n;i>0;--i)
            scanf("%d",&l[i]);
               k+=8;
        solve();
    }
return 0;
}