Go: package main

import (
	"bufio"
	_ "container/heap"
	"fmt"
	"os"
	_ "sort"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func lcm(a, b int) int {
	return a / gcd(a, b) * b
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
const MOD = int(1e+9) + 7
const INF = 1 << 60

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	defer wtr.Flush()
	for true {
		N, M := sc.nextInt(), sc.nextInt()
		if N == 0 && M == 0 {
			break
		}
		C := sc.nextIntSlice(M)
		X := sc.nextIntSlice(N)
		dp := make([][256]int, N+1)
		for i := 0; i < N+1; i++ {
			for j := 0; j < 256; j++ {
				dp[i][j] = INF
			}
		}
		dp[0][128] = 0
		for i := 0; i < N; i++ {
			for j := 0; j < 256; j++ {
				if dp[i][j] == INF {
					continue
				}
				for k := 0; k < M; k++ {
					nex := j + C[k]
					if nex < 0 {
						nex = 0
					}
					if nex > 255 {
						nex = 255
					}
					dp[i+1][nex] = min(dp[i+1][nex], dp[i][j]+pow(X[i]-nex, 2))
				}
			}
		}
		ans := INF
		for i := 0; i < 256; i++ {
			ans = min(ans, dp[N][i])
		}
		fmt.Fprintln(wtr, ans)
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    while (true) {
        int N, M;
        cin >> N >> M;
        if (N == 0 && M == 0) break;
        vector<int> C(M), x(N);
        for (auto &c : C) cin >> c;
        for (auto &p : x) cin >> p;

        vector<vector<ll> > dp(N + 1, vector<ll>(256, LLONG_MAX));
        dp.at(0).at(128) = 0;
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j <= 255; ++j) {
                if (dp.at(i).at(j) == LLONG_MAX) continue;
                for (auto &c : C) {
                    int y = j + c;
                    if (y > 255) y = 255;
                    if (y < 0) y = 0;
                    dp.at(i + 1).at(y) = min(dp.at(i + 1).at(y), dp.at(i).at(j) + (ll)pow(y - x.at(i), 2));
                }
            }
        }

        ll ans = LLONG_MAX;
        for (int j = 0; j <= 255; ++j) {
            ans = min(ans, dp.at(N).at(j));
        }
        cout << ans << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;
int dp[20000][256];
int main(){
  for(int n,m;cin>>n>>m,n;){
    int c[20000],x[20];
    for(int i=0;i<n;i++) fill(dp[i],dp[i]+256,(int)1e9);
    for(int i=0;i<m;i++) cin>>x[i];
    for(int i=0;i<n;i++) cin>>c[i];
    for(int i=0;i<m;i++) dp[0][x[i]+128]=pow(x[i]+128-c[0],2);
    for(int i=1;i<n;i++){
      for(int j=0;j<256;j++){
	if(dp[i-1][j]!=1e9){
	  for(int k=0;k<m;k++){
	    int num=j+x[k];
	    if(num<0) num=0;
	    if(num>255) num=255;
	    dp[i][num]=min(dp[i][num],dp[i-1][j]+(int)pow(c[i]-num,2));
	  }
	}
      }
    }
    /*
      for(int i=0;i<n;i++){
      for(int j=0;j<256;j++) cout<<(dp[i][j]!=1e9?dp[i][j]:-1)<<" ";
      cout<<endl;
      }*/
    int sm=1e9;
    for(int i=0;i<256;i++) sm=min(sm,dp[n-1][i]);
    cout<<sm<<endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair

int main() {
    while (true) {
        int N, M; cin >> N >> M;
        if (N == 0 && M == 0) break;
        vector<int> C(M), x(N);
        REP(i, M) cin >> C[i];
        REP(i, N) cin >> x[i];

        vector<vector<int>> dp(N+1, vector<int>(256, MOD));
        dp[0][128] = 0;

        REP(i, N) {
            REP(j, 256) {
                REP(k, M) {
                    int a = j + C[k];
                    if (a < 0) a = 0;
                    if (a >= 256) a = 255;
                    dp[i+1][a] = min(dp[i+1][a], dp[i][j] + (int)pow(a - x[i], 2));
                }
            }
        }

        int min_sum = MOD;
        REP(i, 256) min_sum = min(min_sum, dp[N][i]);
        PRINT(min_sum);

    }
    return 0;
}

C++: #include "bits/stdc++.h"
#include "math.h"
 
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<vin> vvin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);--i)
#define SIZE(a) int((a).size())
const int MOD=1e9+7;

int main(){

  ll n=1,m=1;
  while(n!=0){
  cin>>n>>m;ll ans=MOD;
  if(n==0&&m==0){break;}
  vll c(m),x(n);
  vvll dp(n+1,vll(256,MOD));
  rep(i,0,m){cin>>c[i];}
  rep(i,0,n){cin>>x[i];}
  dp[0][128]=0;
  rep(i,0,n){
    rep(j,0,256){
      rep(k,0,m){
        int yn=j+c[k];
        if(yn>=255){yn=255;}
        if(yn<=0){yn=0;}
        dp[i+1][yn]=min(dp[i+1][yn],dp[i][j]+(yn-x[i])*(yn-x[i]));
      }
    }
  }
  rep(i,0,256){
    ans=min(dp[n][i],ans);
  }
  cout<<ans<<endl;
  }
}

C++: #include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}
int dp[25000][300];
int  main(){
  while(1){
    int n,m;
    cin>>n>>m;
    int c[20],x[25000];
    if(n==0&& m==0) break;
    lp(i,25000){
      lp(j,300){
	dp[i][j]=-1;
      }
    }
    lpin(c,i,m);
    lpin(x,i,n);
    dp[0][128]=0;
    for(int i=1;i<=n;i++){
      lp(j,256){
	if(dp[i-1][j]!=-1){
	  lp(k,m){
	    if(dp[i][max(min(j+c[k],255),0)]==-1){
	      dp[i][max(min(j+c[k],255),0)]=dp[i-1][j]+(max(min(j+c[k],255),0)-x[i-1])*(max(min(j+c[k],255),0)-x[i-1]);
	    }
	    else
	    dp[i][max(min(j+c[k],255),0)]=min(dp[i-1][j]+(max(min(j+c[k],255),0)-x[i-1])*(max(min(j+c[k],255),0)-x[i-1]),dp[i][max(min(j+c[k],255),0)]);
	  }
	}
      }
    }
    int ans=-1;
    lp(i,300){
      if(dp[n][i]!=-1){
	if(ans==-1)
	  ans=dp[n][i];
	else ans=min(ans,dp[n][i]);
      }
    }
    cout<<ans<<endl;
  }
  return 0;
}