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++: #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define all(obj) obj.begin(), obj.end()
#define from1(obj) obj.begin() + 1, obj.end()
#define db(x) cerr << #x << ":" << x << " "
#define dbl(x) cerr << #x << ":" << x << "\n"
#define dbp(p) cerr << #p << ":(" << p.first << ", " << p.second << ") "
#define dbpl(p) cerr << #p << ":(" << p.first << ", " << p.second << ")\n"
#define dbt3(t3) cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " << get<2>(t3) << ") "
#define dbt3l(t3) cerr << #t3 << ":(" << get<0>(t3) << ", " << get<1>(t3) << ", " << get<2>(t3) << ")\n"
#define dbt4(t4) cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " << get<2>(t4) << ", " << get<3>(t4) << ") "
#define dbt4l(t4) cerr << #t4 << ":(" << get<0>(t4) << ", " << get<1>(t4) << ", " << get<2>(t4) << ", " << get<3>(t4) << ")\n"
#define dbv(vec) cerr << #vec << ":{ "; for (auto e : vec) cerr << e << ", "; cerr << "}\n"
#define dbvv(vv) cerr << #vv << ":{\n"; for (auto vec : vv) { cerr << "{ "; for (auto e : vec) cerr << e << ", "; cerr << "}\n"; } cerr << "}\n"
#define dbm(map) cerr << #map << ":{ "; for (auto p : map) cerr << "(" << p.first << ", " << p.second << "), "; cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using vi = vector<int>; using vl = vector<ll>; using vs = vector<string>; using vb = vector<bool>;
using vvi = vector<vi>; using vvl = vector<vl>; using vvb = vector<vb>;
using pii = pair<int, int>; using pil = pair<int, ll> ; using pll = pair<ll, ll>; using pli = pair<ll, int>;
using vpii = vector<pii>; using vpll = vector<pll>;
using ti3 = tuple<int, int, int>; using tl3 = tuple<ll, ll, ll>;
using ti4 = tuple<int, int, int, int>; using tl4 = tuple<ll, ll, ll, ll>;
using mii = map<int, int>; using mil = map<int, ll>; using mll = map<ll, ll>; using mli = map<ll, int>;

int main() {
	const int MAX = 255, INF = 1e9;
	while(true) {
		int N, M; cin >> N >> M;
		if (N == 0 and M == 0) break;
		// コードブック中の値の番号 k は0-ind( k = 0 ~ M-1 )
		vector<int> C(M); rep(k, M) cin >> C[k];
		// 信号及び復号化後の値の番号 i は1-ind( i = 1 ~ N )
		vector<int> x(N + 1); rep2(i, 1, N + 1) cin >> x[i]; // 1-ind
		// dbv(C); dbv(x);
		vvi dp(N + 1, vi(MAX + 1, INF)); // dp[i][j]:y[0]=128からy[i]までの列で，y[i]=jであるようなものの差y[i]-x[i]の二乗和の最小値
		dp[0][128] = 0;
		// 遷移:現在の値 j = y[i] に値 C[k] を加え，丸めた値を nj = min(max(j + C[k], 0), MAX) とする。
		// dp[i+1][nj] = min(dp[i+1][nj], dp[i][j] + (nj - x[i+1])^2) である。
		// rep(j, MAX + 1) if (dp[0][j] != INF) { dbp(pii(0, j)); dbl(dp[0][j]); }
		rep(i, N) { // i = 0 ~ N
			rep(j, MAX + 1) { // j = 0 ~ MAX(255)
				if (dp[i][j] == MAX) continue;
				rep(k, M) { // k = 0 ~ M - 1
					int nj = min(max(j + C[k], 0), MAX);
					dp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + (nj - x[i + 1]) * (nj - x[i + 1]));
				}				
			}
			// rep(j, MAX + 1) if (dp[i + 1][j] != INF) { dbp(pii(i + 1, j)); dbl(dp[i + 1][j]); }
		}		
		cout << *min_element(all(dp[N])) << endl;
	}
}

C++: #include<iostream>
#include<algorithm>
using namespace std;

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int dp[n+1][256];
    for(int i=0;i<=n;i++)
      for(int j=0;j<256;j++)
	dp[i][j]=1<<30;
    dp[0][128]=0;
    int c[m],x[n];
    for(int i=0;i<m;i++)cin>>c[i];
    for(int i=0;i<n;i++)cin>>x[i];
    
    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++){
	for(int k=0;k<m;k++){
	  if(j+c[k]<0){
	    dp[i+1][0]=min(dp[i+1][0],dp[i][j] + x[i]*x[i]);
	  }else if(j+c[k]>255){
	    dp[i+1][255]=min(dp[i+1][255],dp[i][j] + (x[i]-255)*(x[i]-255));
	  }else{
	    dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j] + (x[i]-j-c[k])*(x[i]-j-c[k]));
	  }
	}
      }
    }
    // for(int j=0;j<256;j++){
    //   for(int i=0;i<n;i++){
    // 	cout << dp[i][j] << " ";
    //   }
    //   cout << endl;
    // }

    int res=1<<30;
    for(int i=0;i<256;i++)res=min(res,dp[n][i]);
    cout << res << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000

int main()
{
    int N, M;
    while (true)
    {
      cin >> N >> M;
      if (N == 0 && M == 0)
      {
        break;
      }
      vector<int> C(M);
      vector<int> X(N);
      for (int i = 0; i < M; ++i)
      {
        cin >> C.at(i);
      }
      for (int i = 0; i < N; ++i)
      {
        cin >> X.at(i);
      }

      vector<vector<int>> dp(N + 1, vector<int>(256, INF));
      dp.at(0).at(128) = 0;
      for (int i = 0; i < N; ++i)
      {
        for (int j = 0; j < 256; ++j)
        {
          if (dp.at(i).at(j) == INF)
          {
            continue;
          }
          int dp_ij = dp.at(i).at(j);
          for (int k = 0; k < M; ++k)
          {
            int next_j = max(0, min(j + C.at(k), 255));
            dp.at(i + 1).at(next_j) = min(dp.at(i + 1).at(next_j), dp.at(i).at(j) + int(pow(X.at(i) - next_j, 2.0)));
          }
        }
      }
      int ans = INF;
      for (int i = 0; i < 256; ++i)
      {
        if (dp.at(N).at(i) == INF)
        {
          continue;
        }
        ans = min(dp.at(N).at(i), ans);
      }
      cout << ans << endl;
    }
}