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 <vector>
#include <unordered_map>
int square(int x){
	return x * x;
}
int main()
{
	using namespace std;
	int N, M, i, j, c, k, v, y, sub_sq, min;
	vector <int> C, x;
	unordered_map <int, int> :: iterator it;
	while (true) 
	{
		cin >> N >> M;
		if (N == 0 and M == 0) break;
		C.resize(M); x.resize(N);
		for (i=0;i<M;i++) cin >> C[i];
		for (i=0;i<N;i++) cin >> x[i];
		unordered_map <int, int> dp;
		dp[128] = 0;
		for(i = 0; i < N; i++)
		{
			unordered_map <int, int> tmpdp;
			for (it = dp.begin();it != dp.end(); it++)
			{
				k = it->first; v = it->second;
				for(j = 0; j < M; j++)
				{
					c = C[j];
					if (k + c > 255) y = 255;
					else if (k + c < 0) y = 0;
					else y = k + c;
					sub_sq = square(x[i]-y);
					if(not(tmpdp.count(y) != 0 and v + sub_sq >= tmpdp[y])) 
						tmpdp[y] = v + sub_sq;
				}
			}
			dp = tmpdp;
		}
		it = dp.begin();
		min = it -> second;
		it++;
		for(;it != dp.end();it++) min = min < it -> second ? min : it -> second;  
		cout << min << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <climits>
using namespace std;
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REP(i,n) FOR(i,0,n)
typedef vector<int> vi;
typedef vector<vi> vii;

int main(){
	int n,m;
	while(cin>>n>>m,n&&m){
		vi c(m),x(n);
		REP(i,m){
			cin>>c[i];
		}
		REP(i,n){
			cin>>x[i];
		}

		vii dp(n+1,vi(256,INT_MAX));
		dp[0][128]=0;
		REP(i,n){
			REP(j,256){
				if(dp[i][j]==INT_MAX)continue;
				REP(k,m){
					int y=j+c[k];
					if(y<0)y=0;
					if(y>255)y=255;
					dp[i+1][y]=min(dp[i+1][y],dp[i][j]+(int)pow((double)y-x[i],2));
				}
			}
		}
		int ans=INT_MAX;
		REP(i,256){
			ans=min(ans,dp[n][i]);
		}
		cout<<ans<<endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int mod=1e9+7;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,m;
    while(cin >> n >> m){
        if(n==0&&m==0){
            return 0;
        }
        vector<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];
        }
        vector<vector<int>> dp(n+1,vector<int>(256,inf));
        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 t=max(0,min(255,j+c[k]));
                    chmin(dp[i+1][t],dp[i][j]+(t-x[i])*(t-x[i]));
                }
            }
        }
        int ans=inf;
        for(int i=0;i<=255;i++){
            chmin(ans,dp[n][i]);
        }
        cout << ans << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = ((int)a) - 1; i >= ((int)a); --i)
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;

void dump_impl(string s) {}
template <class H, class... T>
void dump_impl(string s, H head, T... tail) {
    int p = 0;
    rep(i, 0, sz(s)) {
        char x = s[i];
        if (p == 0 && x == ',') {
            cerr << "=" << head << ", ";
            dump_impl(s.substr(i + 1), tail...);
            return;
        } else {
            cerr << x;
            if (x == '(') p++;
            if (x == ')') p--;
        }
    }
}
#ifdef LOCAL
#define dump(...) do { cerr << "\x1b[33;1m"; dump_impl(#__VA_ARGS__ ",", __VA_ARGS__); cerr << "\x1b[0m" << endl; } while (0) 
#else
#define dump(...)
#endif

constexpr int DY[8] = {-1, 0, 1, 0, -1, 1, 1, -1};
constexpr int DX[8] = {0, 1, 0, -1, 1, 1, -1, -1};

void solve(int N, int M) {
    vi C(M);
    rep(i, 0, M) cin >> C[i];
    vi X(N);
    rep(i, 0, N) cin >> X[i];

    vvi dp(N + 1, vi(256, 1e9));
    dp[0][128] = 0;
    rep(i, 0, N) {
        rep(j, 0, 256) {
            rep(k, 0, M) {
                int jj = j + C[k];
                jj = max(jj, 0LL);
                jj = min(jj, 255LL);
                dp[i + 1][jj] = min(dp[i + 1][jj], dp[i][j] + (jj - X[i]) * (jj - X[i]));
            }
        }
    }
    int ans = 1e9;
    rep(i, 0, 256) {
        ans = min(ans, dp[N][i]);
    }
    cout << ans << endl;
}

signed main() {
    while (1) {
        int N, M;
        cin >> N >> M;
        if (N == 0 && M ==0) break;
        solve(N, M);
    }
}