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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

ll n, m;
ll c[100], x[20010];
ll dp[20][300];

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 20)REP(j, 300)dp[i][j] = INF;
		REP(i, m)cin >> c[i];
		REP(i, n)cin >> x[i];
		dp[0][128] = 0;
		REP(i, n){
			REP(j, m){
				REP(k, 256){
					int num = k + c[j];
					if (num < 0)num = 0;
					if (num > 255)num = 255;
					dp[i + 1][num] = min(dp[i][k] + (x[i] - (num))*(x[i] - (num)), dp[i + 1][num]);
				}
			}
		}
		ll ans = INF;
		//REP(i, n + 1){
		//	cout << i << endl;
		//	FOR(j, 120, 140){
		//		cout << dp[i][j] << " ";
		//	}
		//	cout << endl;
		//}
		REP(i, 300){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <complex>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <stack>
#include <cmath>
#include <iomanip>
#include <sstream>
#include <cassert>

using namespace std;

typedef long long ll;
typedef ll li;
typedef pair<int,int> PI;
#define EPS (1e-10L)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(),a.end()
#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)
void pkuassert(bool t){t=1/t;};
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,-1,1,1,-1};

ll dp[2][256];
int C[16];
int x[20000];
int N,M;

void solve(){
  rep(i,M) cin >> C[i];
  rep(i,N) cin >> x[i];
  memset(dp,-1,sizeof(dp));
  dp[0][128]=0;
  rep(i,N){
    int cu=i&1;
    int ne=(i+1)&1;

    rep(j,256){
      if(dp[cu][j]==-1) continue;
      //cout << i << ' ' << dp[cu][j] << endl;
      rep(k,M){
        int nx=j+C[k];
        nx=min(nx,255);
        nx=max(nx,0);
        int di=nx-x[i];
        if(dp[ne][nx]==-1 || dp[ne][nx]>dp[cu][j]+di*di)
          dp[ne][nx]=dp[cu][j]+di*di;
      }
      dp[cu][j]=-1;
    }
  }
  
  ll ans=1LL<<50LL;
  rep(i,256) if(dp[N&1][i]!=-1) ans=min(ans,dp[N&1][i]);
  cout << ans << endl;
}

int main(int argc, char *argv[])
{
  while(cin >> N >> M && N && M) solve();
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
const double EPS = 1e-9;
typedef pair<int, int> P;
typedef unsigned int ui;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
int main() {
	int n, m;
	while (cin >> n >> m, n) {
		int c[16];
		rep(i, m) {
			cin >> c[i];
		}
		ll x[20001];
		rep1(i, n) {
			cin >> x[i];
		}
		ll dp[20001][256];
		rep(j, 256) {
			rep(i, 20001) {
				dp[i][j] = INF;
			}
		}
		dp[0][128] = 0;
		rep1(i, n) {
			rep(k, m) {
				rep(j, 256) {
					int r = j + c[k];
					if (r < 0)r = 0;
					if (r > 255)r = 255;
					dp[i][r] = min(dp[i][r],dp[i - 1][j]+(ll)(r-x[i])*(r-x[i]));
				}
			}
		}
		ll out=INF;
		rep(i, 256) {
			out = min(out, dp[n][i]);
		}
		cout << out << endl;
	}
	return 0;
}