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 rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
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;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
    while (1) {
        int n, m;
        cin >> n >> m;
        if (n == 0 && m == 0) break;
        vector<ll> c(m), x(n);
        rep(i, m) cin >> c[i];
        rep(i, n) cin >> x[i];

        auto dp = make_vec<ll>(n + 10, 256);
        rep(i, n + 10) rep(j, 256) dp[i][j] = LINF;
        dp[0][128] = 0;
        rep(i, n) {
            rep(j, 256) {
                rep(k, m) {
                    int nxt = min(255ll, max(0ll, j + c[k]));
                    chmin(dp[i + 1][nxt],
                          dp[i][j] + (x[i] - nxt) * (x[i] - nxt));
                }
            }
        }
        ll ans = LINF;
        rep(j, 256) chmin(ans, dp[n][j]);
        cout << ans << endl;
    }
}

C++: #include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector<vd>;
using vvvi = vector<vvi>;
using vvvll = vector<vvll>;
using vvvd = vector<vvd>;

const double pi=acos(-1);
const ll MOD=1e9+7;
const ll INF=(1LL<<60);

int n,m;
int c[17],x[20010];
int dp[20010][256];

int main() {
    while (1){
        cin>>n>>m;
        if (n==0 && m==0)return 0;
        memset(c,0,sizeof(c));
        memset(x,0,sizeof(x));
        rep(i,m)cin>>c[i];
        rep(i,n)cin>>x[i+1];
        vvi dp(n+1,vi(256,1e9*2));
        //cout<<dp[1][1]<<endl;
        dp[0][128]=0;
        for (int i=0;i<n;i++){
            for (int j=0;j<256;j++){
                if (dp[i][j]==1e12*2)continue;
                else {
                    rep(k,m){
                        int num=j+c[k];
                        if (num<0)num=0;
                        if (num>255)num=255;
                        int dx=num-x[i+1];
                        dp[i+1][num]=min(dp[i+1][num],dp[i][j]+dx*dx);
                    }
                }
            }
        }
        int ans=1e9*2;
        rep(i,256)ans=min(ans,dp[n][i]);
        cout<<ans<<endl;

    }
    

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll=long long;
//const ll MOD=(ll)1e9+7;
const ll MOD=(ll)998244353;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);

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 (a>b) { a=b; return 1; } return 0; }
int dy[]={-1,1,0,0};
int dx[]={0,0,-1,1};

void solve(int ca){
    while(true){
        int N,M; cin>>N>>M;
        if(N==0&&M==0) break;
        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<ll>> dp(N+1,vector<ll>(256,INF));
        dp[0][128]=0ll;
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < 256; ++j) {
                for (int k = 0; k < M; ++k) {
                    int val=j+c[k];
                    if(val<0) val=0;
                    if(val>255) val=255;
                    chmin(dp[i+1][val],dp[i][j]+(x[i]-val)*(x[i]-val));
                }
            }
        }
        ll ans=INF;
        for (int i = 0; i < 256; ++i) {
            chmin(ans,dp[N][i]);
        }
        cout<<ans<<endl;
    }
}

//#define MULTI
int main() {
    //ios::sync_with_stdio(false);
    //cin.tie(nullptr);
#ifdef MULTI
    int N; cin>>N;
    for (int i = 0; i < N; ++i) {
        solve(i+1);
    }
#else
    solve(1);
#endif
    return 0;
}