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 <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int n, m;
	while (cin>>n>>m,n) {
		vi cb(m);
		REP(i, m)
			cin >> cb[i];
		vi os(n);
		REP(i, n)
			cin >> os[i];
		vi memo(256,1000000000);
		memo[128] = 0;
		REP(i, n) {
			vi copy(256, 1000000000);
			REP(j, 256) {
				if (memo[j] != 1000000000) {
					REP(k, m) {
						copy[min(255, max(0, j + cb[k]))] = memo[j] + (os[i] - min(255, max(0, j + cb[k])))*(os[i] - min(255, max(0, j + cb[k])));
					}
				}
			}
			memo = copy;
		}
		int ans = 1e9;
		REP(i, 256)
			ans = min(ans, memo[i]);
		cout << ans << endl;
	}
}

C++: 2 7
4
2
1
0
-1
-2
-4
131
137
2 7
4
2
1
0
-1
-2
-4
131
123
10 7
-4
-2
-1
0
1
2
4
132
134
135
134
132
128
124
122
121
122
5 1
255
0
0
0
0
0
4 1
0
255
0
255
0
0 0

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>c,x;
#define MA 99999999
int dp[20000][20002];
int main(){
    int n,m,f,ans;
    
    while(cin >>  n >>m&& n){
        for(int i=0;i<20;i++)
            for(int j=0;j<20002;j++)
                dp[i][j]=MA;
        c.clear();
        x.clear();
        ans=MA;
        for(int i=0;i<m;i++){
            cin>>f;
            c.push_back(f);
            //cout<<"c[i]: "<<c[i]<<endl;
        }
        for(int i=0;i<n;i++){
            cin>>f;
            x.push_back(f);
            //cout<<"x[i]:"<<x[i]<<endl;
        }
        dp[0][128]=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<256;j++){
                if(dp[i][j]==MA)
                    continue;
                for(int k=0;k<m;k++){
                    
                    int 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] +(x[i]-nex)*(x[i]-nex));
                    // cout<<"i: "<<i<<"     j:"<<j<<"      k: "<<k<<"      c[k]: "<<c[k]<<"      dp[i][j]: "<<dp[i][j]<<"         x[i+1]: "<<x[i+1]<<"       i+1: "<<i+1<<"        nex:"<<nex<<"       dp[i+1][nex]:"<<dp[i+1][nex]<<endl;
                }
            }
        }
        for(int j=0;j<256;j++)ans=min(ans,dp[n][j]);
        cout<<ans<<endl;
    }
}

C++: #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;

const long long INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
typedef long long ll;
//約数列挙
vector<long long> divisor(long long n) {
    vector<long long> ret;
    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    //sort(ret.begin(), ret.end()); // 昇順に並べる
    return ret;
}
vector<int> dx={1,0,-1,0};vector<int> dy={0,-1,0,1};

signed main () {
    int n,m;scanf("%d %d",&n,&m);
    while(n!=0 && m!=0){
        vector<int> cb(m);
        REP(i,m){
            int tmp;scanf("%d",&tmp);
            cb[i]=tmp;
        }
        vector<int> list(n);
        REP(i,n){
            int tmp;scanf("%d",&tmp);
            list[i] = tmp;
        }
        vector<vector<ll>> dp(n+1,vector<ll>(256,INF));
        dp[0][128]=0;
        REP(i,n){
            REP(j,256){
                if(dp[i][j]==INF)continue;
                REP(l,m){
                    int y = j+cb[l];
                    if(y<0)y = 0;
                    if(y>255)y = 255;
                    int sum = (list[i]-y)*(list[i]-y);
                    dp[i+1][y]=min(dp[i+1][y], dp[i][j] + sum );
                }
            }
        }
        cout << *min_element(dp[n].begin(),dp[n].end()) << endl;
        scanf("%d %d",&n,&m);
    }

}