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 int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define REP(i,n) for(int i = 0;i < n; i++)
#define all(a) a.begin(),a.end()
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
const long long MOD = 1000000007, INF = 1e18;
 
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
 
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>vector<T>
make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
	return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
 
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
 
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
	for(auto &e:t) fill_v(e,v);
}

/*bool operator<(const data &d)const{
	return hoge;
}*/
 
const int dx[]={0,1,1,-1,-1,0};
const int dy[]={1,1,0,0,-1,-1};
set<char>vowel={'a','i','u','e','o'};

int marume(int x){
	if(x>255)return 255;
	if(x<=0)return 0;
	return x;
}
 
signed main(){
	IOS();
	int N,M;
	vector<int>ans;
	while(cin>>N>>M,N||M){
		vector<int>c(M),x(N);
		REP(i,M)cin>>c[i];
		REP(i,N)cin>>x[i];
		vector<int>dp(256,INF);
		dp[128] = 0;
		rep(i,0,N){
			vector<int>ndp(256,INF);
			rep(j,0,256){
				if(dp[j]==INF)continue;
				rep(k,0,M){
					int t =max(0ll,min(255ll,j+c[k]));
					chmin(ndp[t],dp[j]+(t-x[i])*(t-x[i]));
				}
			}
			swap(dp,ndp);
		}
		ans.push_back(*min_element(all(dp)));
	}
	for(auto e:ans){
		cout<<e<<endl;
	}
}

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

#define INF 1e9
#define llINF 1e18
#define MOD 1e9+7
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define sqr(x) (x)*(x)
using namespace std;
vector<int>C(5000);
vector<int>x(100000);
int ans=0;
int n,m;
int main(){
  while(cin>>n>>m,n){
    ans=llINF;
    int dp[n+20][530]={};
    for(int i=0;i<n+2;i++)
      for(int j=0;j<520;j++)
	dp[i][j]=llINF;
    for(int i=0;i<m;i++)
      cin>>C[i];
    for(int i=0;i<n;i++){
      cin>>x[i];
      x[i]+=260;
    }

    dp[0][128+260]=0;
    for(int i=1;i<=n;i++){
      for(int j=5;j<=515;j++){
	if(dp[i-1][j]!=llINF){
	  for(int k=0;k<m;k++){
	    int num=j+C[k];
	    if(num>=515)num=515;
	    else if(num<=5)num=5;
	    //cout<<i<<" "<<
	    dp[i][num]=min(dp[i-1][j]+((num-x[i-1])*(num-x[i-1])),dp[i][num]);
	  }
	}
      }
    }
    for(int i=0;i<520;i++){
      ans=min(dp[n][i],ans);
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

inline int normalize(int y) {
    return min(255, max(0, y));
}

inline int get_error(int y, int y0) {
    y -= y0;
    return y * y;
}

int errors[20001][256];
int solve(int n, int m, int c[], int x[]) {
    int min_error = -1;
    for (int t = 0; t <= n; ++t) {
        for (int y = 0; y < 256; ++y) {
            errors[t][y] = -1;
        }
    }
    errors[0][128] = 0;
    for (int t = 0; t < n; ++t) {
        for (int y = 0; y < 256; ++y) {
            if (errors[t][y] < 0) {
                continue;
            }
            for (int i = 0; i < m; ++i) {
                int yn = normalize(y + c[i]);
                int e = errors[t][y] + get_error(yn, x[t]);
                if (errors[t + 1][yn] < 0 || e < errors[t + 1][yn]) {
                    errors[t + 1][yn] = e;
                }
            }
        }
    }
    for (int y = 0; y < 256; ++y) {
        if (errors[n][y] < 0) {
            continue;
        }
        if (min_error < 0 || errors[n][y] < min_error) {
            min_error = errors[n][y];
        }
    }
    return min_error;
}

int main() {
    int n, m;
    int c[16], x[20000];
    while (true) {
        cin >> n >> m;
        if (n == 0) {
            return 0;
        }
        for (int i = 0; i < m; ++i) {
            cin >> c[i];
        }
        for (int i = 0; i < n; ++i) {
            cin >> x[i];
        }
        cout << solve(n, m, c, x) << endl;
    }
}