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

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

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

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int dp[20010][300];//
int C[20];
int X[20010];
int n,m;


int main(){
	while(cin>>n>>m,n||m){
		memset(dp, 0, sizeof(dp));
		memset(C, 0, sizeof(C));
		memset(X, 0, sizeof(X));
		for(int i =0;i < m;i++){
			cin>>C[i];
			//cout<<C[i]<<endl;
		}
		for(int i =0;i < n;i++){
			cin>>X[i];
			//cout <<X[i]<<endl;
		}
		memset(dp, INF, sizeof(dp));
		//rep(i, n+1)rep(j,256)dp[i][j] =INF;
		dp[0][128] = 0;
		for(int i =0;i < n;i++){
			for(int j =0;j < m;j++){
				for(int k =0;k <=255;k++){
					if(dp[i][k]==INF)continue;
					int val =k +C[j];
					if(val >255)val =255;
					if(val <0)val = 0;
					dp[i+1][val] =min(dp[i+1][val],dp[i][k]+(X[i]-val)*(X[i]-val));
					//cout <<(X[i]-val)*(X[i]-val)<<endl;
				}
			}
		}
		int ans = INF;
		for(int i =0;i <=255;i++){
			ans =min(ans,dp[n][i]);
		}
		cout <<ans<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define INF 2e9
#define rep(i,n) for(int i=0;i<n;i++)

int N,M,c[16],dp[256];

int main(){
	while(cin>>N>>M&&N){
		fill(dp,dp+256,0);
		rep(i,M)cin>>c[i];
		rep(i,N){
			int m,dp2[256];
			fill(dp2,dp2+256,INF);
			cin>>m;
			rep(j,256)rep(k,M){
				int n=j+c[k];
				if(n<0)n=0;
				if(n>255)n=255;
				dp2[n]=min(dp2[n],dp[j]+(m-n)*(m-n));
			}
			rep(j,256)dp[j]=dp2[j];
		}
		int ans=INF;
		rep(i,256)ans=min(ans,dp[i]);
		cout<<ans<<endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;

const int INF = 1e8;

int main(){
  int n,m;
  while(cin >> n >> m, n){
    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<int> cur(256,INF), nxt(256);
    cur[128] = 0;

    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++)nxt[j] = INF;

      for(int j=0;j<256;j++){
	for(int k=0;k<m;k++){
	  int nj = min(255, max(0,j + c[k]) );
	  int dif = nj-x[i];
	  nxt[nj] = min(nxt[nj], cur[j] + dif*dif);
	}
      }
      swap(cur, nxt);
    }

    cout << *min_element(cur.begin(),cur.end()) << endl;
  }

}

C++: #include <bits/stdc++.h>
#define ll long long
using namespace std;

const int INF = 1e9;

int main() {
    int n, m;
    while (cin >> n >> m, n | m) {
        vector<int> c(m, 0), x(n, 0);
        for (int i = 0; i < m; i++) cin >> c[i];
        for (int i = 0; i < n; i++) cin >> x[i];
        // dp[i][j] := i個目の信号まででyがjのときの最小値
        vector<vector<int> > dp(20005, vector<int>(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 y = max(0, min(255, j + c[k]));
                    dp[i + 1][y] = min(dp[i + 1][y], dp[i][j] + (x[i] - y) * (x[i] - y));
                }
            }
        }
        int ans = 1e9;
        for (int i = 0; i < 256; i++) ans = min(ans, dp[n][i]);
        cout << ans << endl;
    }
    return 0;
}