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;
#define ll long long
#define INF (1LL << 60)
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2199&lang=jp

#define ll long long

int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int N, M;
	while (cin >> N >> M) {
		if (N == 0 && M == 0) break;
		// dp[i][j] := i??????????????????,?????????j?????????????????????????°????
		vector<vector<ll>> dp(N + 1, vector<ll>(256, INF));
		vector<int> C(M + 1);
		for (int i = 0; i < M;i++) cin >> C[i];
		vector<int> x(N + 1);
		for (int i = 0;i < N;i++) cin >> x[i];

		//????????¶???
		dp[0][128] = 0;

		for (int i = 0; i < N;i++) {
			for (int j = 0; j <= 255;j++) {
				if (dp[i][j] == INF) continue;
				for (int k = 0; k < M;k++) {
					int J = max(0, min(255, j + C[k]));
					int cost = pow(x[i] - J, 2);
					dp[i + 1][J] = min(dp[i + 1][J], dp[i][j] + cost);
				}
			}
		}

		ll ans = INF;
		for (int j = 0; j <= 255;j++) {
			//if (dp[N][j] != INF) cout << dp[N][j] << endl;
			ans = min(ans, dp[N][j]);
		}
		cout << ans << endl;
	}
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main() {
 int n,m;
 while(cin >> n >> m, n) {
  vector<int> code(m), value(n);
  for (int i = 0; i < m; i++)
   cin >> code[i];
  for (int i = 0; i < n; i++)
   cin >> value[i];
  vector<vector<int> > dp(256, vector<int>(n + 1, 1000000000));
  dp[0][128] = 0;
  for (int i = 0; i < n; i++) {
   for (int j = 0; j < 256; j++) {
    for (int k = 0; k < m; k++) {
     int val = min(255,max(0,j+code[k]));
     dp[i+1][val] = min(dp[i+1][val], dp[i][j] + (val -value[i]) * (val - value[i]));
    }
   }
  }
  int ans = 1000000000;
  for (int i = 0; i < 256; i++) {
   ans = min(ans, dp[n][val]);
  }
  cout << ans << endl;
 }
 return 0;
}

C++: #include <algorithm>
#include <iostream>
using namespace std;
int main(){
  int N, M;
  while(cin >> N >> M, N){
    long long int C[M];
    long long int INF = 10000000000LL;
    for(int i = 0; i < M; ++i)
      cin >> C[i];
    sort(C,C+M);
    long long int x[N];
    for(int i = 0; i < N; ++i)
      cin >> x[i];
    long long int dp[N][256];
    for(int i = 0; i < N; ++i){
      fill(dp[i],dp[i]+256,INF);
    }
    for(int i = 0; i < M; ++i){
      int t = max(min(255,128+(int)C[i]),0);
      dp[0][t] = (x[0]-t)*(x[0]-t);
    }
    for(int i = 1; i < N; ++i){
      for(int j = 0; j < 256; ++j){
	if(dp[i-1][j] == INF) continue;
	for(int k = 0; k < M; ++k){
	  int t = max(min(255,j+(int)C[k]),0);
	  dp[i][t] = min(dp[i][t], dp[i-1][j] + (x[i]-t)*(x[i]-t));
	  if(j + C[k] > 255) break;
	}
      }
    }
    long long int ans = INF;
    for(int i = 0; i < 256; ++i){
      ans = min(ans, dp[N-1][i]);
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
#define int long long
#define double long double
#define rep(i, a, n) for(int i = (int)(a);(i) < (int)(n);++(i))
#define repe(i, a, n) for(int i = (int)(a);(i) <= (int)(n);++(i))
#define repif(i, a, x) for(int i = (int)(a);(x);++(i))
#define repr(i, a, n) for(int i = ((int)(a)-1);(i) >= (int)(n);--(i))
#define reper(i, a, n) for(int i = (int)(a);(i) >= (int)(n);--(i))
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define CEIL(x) ((int)ceil(((double)x)))
#define POW(x, y) ((int)pow(x, y))
#define UNIQUE(x) (x).erase(unique(ALL((x))), end(x))
#define gcd(x, y) __gcd(x, y)
#define lcm(x, y) ((x)/gcd(x,y)*(y))
#define isin(x, l, r) ((l) <= (x) and (x) < (r))
#define fcout(n) cout << fixed << setprecision(n)
#define rcout(n) cout << right << setw(n)
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define PI (acosl(-1))
#define EPS (1e-10)
#define INF LLONG_MAX
#define INF32 INT32_MAX
#define MOD 1000000007LL
using namespace std;
using VI = vector<int>;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
using VPII = vector<PII>;
using VTIII = vector<TIII>;
using Complex = complex<double>;
template<typename T, template<typename> typename C = less> using PQ = priority_queue<T, vector<T>, C<T>>;
template<typename T> inline bool chmax(T& a, const T& b, bool t = false){ if(a<b or (t and a == b)){ a=b; return true; } return false; }
template<typename T> inline bool chmin(T& a, const T& b, bool t = false){ if(a>b or (t and a == b)){ a=b; return true; } return false; }


signed main(){
    int N, M;
    while(cin >> N >> M, N+M){
        VI C(M), x(N);
        rep(i, 0, M) cin >> C[i];
        rep(i, 0, N) cin >> x[i];
        vector<VI> dp(N+1, VI(300, INF32));
        dp[0][128] = 0;
        rep(i, 0, N) repe(j, 0, 255) rep(k, 0, M){
            int y = j+C[k];
            if(y < 0) y = 0;
            else if(y > 255) y = 255;
            chmin(dp[i+1][y], dp[i][j]+(y-x[i])*(y-x[i]));
        }
        cout << *min_element(begin(dp[N]), end(dp[N])) << endl;
    }

    return 0;
}