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>
#define reps(i,j,k) for(int i = j; i < k; ++i)
#define rep(i,j) reps(i,0,j)
#define pb push_back
#define fr first
#define fs fr
#define sc second
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> Pii;
typedef pair<int,int> pii;
typedef long long ll;

/*
template<class T> &ostream<<(ostream &out, const vecotr<T> &v){
	out << "{";
	rep(i,v.size()) out << v[i] << ", ";
	return out << "}" << endl;
}
*/
struct data{
	int base;
	int val;
	data(){}
	data(int base,int val){
		this->base = base;
		this->val = val;
	}
};
int main(){
	int N,M;
	while(cin >> N >> M,(N|M)){
		vi C(M);
		vi X(N+1);

		rep(i,M){
			cin >> C[i];
		}

		reps(i,1,N+1){
			cin >> X[i];
		}

		data dp[20010][17];

		rep(j,M){
			dp[0][j] = data(128,0);
		}
		reps(i,1,N+1){
			rep(j,M){
				dp[i][j] = data(-1,1e9);
			}
		}

		reps(i,1,N+1){
			rep(j,M){
				int b = -1;
				int v = 1e9;
				rep(k,M){
					int s = dp[i-1][j].base+C[k];
					if(s < 0)s = 0;
					if(s > 255)s = 255;
					int tmp = (X[i]-s)*(X[i]-s);
					if(dp[i][k].val > dp[i-1][j].val+tmp){
						v = tmp + dp[i-1][j].val;
						b = s;
						dp[i][k] = data(b,v);
					}			
				}
			}
		}
		int ans = 1e9;
		rep(j,M){
			ans = min(ans,dp[N][j].val);
		}

		cout << ans << endl;

	}
	return 0;
}

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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX/3
#define MAX_N 1000000001


int main(){
  cin.sync_with_stdio(false);
  int n, m;
  while(cin >> n >> m, n | m) {
    vector<int> c(m), x(n);
    rep(i, m) cin >> c[i];
    rep(i, n) cin >> x[i];

    int dp[n + 1][256];
    rep(i, n + 1)rep(j, 256) dp[i][j] = INF;
    dp[0][128] = 0;
    rep(i, n) {
      rep(j, 256) {
        if (dp[i][j] < INF) {
          rep(k, m) {
            int tmp = j + c[k];
            if (tmp > 255) tmp = 255;
            else if (tmp < 0) tmp = 0;
            minch(dp[i + 1][tmp], dp[i][j] + (x[i] - tmp) * (x[i] - tmp));
          }
        }
      }
    }

    int ans = INF;
    rep(i, 256) minch(ans, dp[n][i]);

    cout << ans << endl;
  }

  return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<iomanip>
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<string> vs;
Def inf = sizeof(Def) == sizeof(ll) ? 2e18:1e9+10;
int main(){
	int n,m;
	while(cin>>n>>m,n||m){
		vi c(m);
		rep(i,m)cin>>c[i];
		vi x(n);
		rep(i,n)cin>>x[i];
		vvi dp(n+1,vi(256,inf));
		dp[0][128]=0;
		rep(i,n)rep(j,256)if(dp[i][j]!=inf){
			rep(k,m){
				int ne=j+c[k];
				ne=max(ne,0);
				ne=min(ne,255);
				dp[i+1][ne]=min(dp[i+1][ne],dp[i][j]+(ne-x[i])*(ne-x[i]));
			}
		}
		int out=inf;
		rep(i,256)out=min(out,dp[n][i]);
		cout<<out<<endl;
		
	}
}