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++: #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#define INF 1LL << 61
#define MAX (1LL << 31) -1
#define MOD 1000000007

typedef long long ll;
typedef pair<int,int> pi;
//typedef pair<pair<int,int>,ll> p;
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
template<class T,class U>bool inline chmin(T&a,const U&b){if(a<=b)return false;a=b;return true;}
template<class T,class U>bool inline chmax(T&a,const U&b){if(a>=b)return false;a=b;return true;}
//__builtin_popcount(S);
//C.erase(unique(C.begin(),C.end()),C.end());
//#define int ll
int dx[]={1,-1,0,0},dy[]={0,0,-1,1};

signed main(){
    while(true){
        int N,M;
        cin>>N>>M;
        if(N==0 && M==0) return 0;

        vector<int> C(M);
        for(int i=0;i<M;i++) cin>>C[i];
        vector<int> x(N);
        for(int i=0;i<N;i++) cin>>x[i];
        vector<vector<ll>> dp(N+1,vector<ll>(256,INF));
        dp[0][128]=0;
        for(int i=0;i<N;i++){
            for(int j=0;j<256;j++){
                if(dp[i][j]==INF) continue;
                for(int k=0;k<M;k++){
                    int jj=j+C[k];
                    if(jj<0) jj=0;
                    else if(jj>255) jj=255;
                    chmin(dp[i+1][jj],dp[i][j]+(ll)(x[i]-jj)*(x[i]-jj));
                }
            }
        }
        ll ans=INF;
        for(int i=0;i<256;i++){
            chmin(ans,dp[N][i]);
        }
        cout<<ans<<endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=20005,INF=1<<30;
int dp[MAX][256];


int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    while(1){
        int N,M;cin>>N>>M;
        if(N+M==0) break;
        
        vector<int> A(M),B(N);
        for(int i=0;i<M;i++) cin>>A[i];
        for(int i=0;i<N;i++) cin>>B[i];
        
        for(int i=0;i<MAX;i++){
            for(int j=0;j<256;j++){
                dp[i][j]=INF;
            }
        }
        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 to=j+A[k];
                    if(to>255) to=255;
                    if(to<0) to=0;
                    
                    dp[i+1][to]=min(dp[i+1][to],dp[i][j]+(to-B[i])*(to-B[i]));
                }
            }
        }
        
        int ans=INF;
        
        for(int j=0;j<256;j++){
            ans=min(ans,dp[N][j]);
        }
        
        cout<<ans<<endl;
    }
}

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{
	vi base;
	int val;
	data(){}
	data(vi 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];
		vi a;
		a.pb(128);
		rep(j,M){
			dp[0][j] = data(a,0);
		}
		a.clear();
		reps(i,1,N+1){
			rep(j,M){
				dp[i][j] = data(a,1e9);
			}
		}

		reps(i,1,N+1){
			rep(j,M){
				int b = -1;
				int v = 1e9;
				rep(k,M){
					rep(q,dp[i-1][j].base.size()){
						int s = dp[i-1][j].base[q]+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;
							vi t;
							t.pb(s);
							dp[i][k] = data(t,v);
						}
						else if(dp[i][k].val == dp[i-1][j].val+tmp){
							dp[i][k].base.pb(s);
						}
					}
				}
			}
		}
		int ans = 1e9;
		rep(j,M){
			ans = min(ans,dp[N][j].val);
		}

		cout << ans << endl;

	}
	return 0;
}

C++: #include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

int c[16], x[16];
int dp[200001][256];
int d(int a) {
	if (a < 0)return 0;
	if (a > 255)return 255;
	return a;
}
int diff(int i, int a) {
	return (x[i] - a)*(x[i] - a);
}
int main() {
	int n, m;
	while (scanf("%d%d", &n, &m), n) {
		rep(i, m)scanf("%d", &c[i]);
		rep(i, n)scanf("%d", &x[i]);
		memset(dp, 0x3f, sizeof(dp));
		dp[0][128] = 0;
		rep(i, n)rep(j, 256) {
			if (dp[i][j] == INF)continue;
			rep(k, m) {
				int a = d(j + c[k]);
				if (i + 1 >= 20001)return 0;
				dp[i + 1][a] = min(dp[i + 1][a], dp[i][j] + diff(i, a));
			}
		}
		int Min = INF;
		rep(j, 256)Min = min(Min, dp[n][j]);
		printf("%d\n", Min);
	}
}