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>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf =1 << 30;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

const int N = 256;

inline int round(int x){
    chmin(x, N - 1);
    chmax(x, 0);
    return x;
}

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);

    for(int n, m; cin >> n >> m, n;){
        vi C(m); for(auto& e : C) cin >> e;
        vi x(n); for(auto& e : x) cin >> e;

        vector<vi> dp(n + 1, vi(N, inf));
        dp[0][128] = 0;

        rep(i, n){
            rep(j, N + 1){
                int cur = dp[i][j];

                if(dp[i][j] == inf) continue;
                for(auto& c : C){
                    int nj = round(j + c);
                    chmin(dp[i + 1][nj], cur + (int)pow(nj - x[i], 2));
                }
            }
        }

        cout << *min_element(_all(dp[n])) << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

struct node {
	int cost;
	int ind;
	int val;
	node(int c, int i, int v) {
		cost = c;
		ind = i;
		val = v;
	}
};

bool checked[20001][256];

bool operator<(const node& lhs, const node& rhs) {
	if( lhs.cost == rhs.cost ) {
		return lhs.ind < rhs.ind;
	}
	return lhs.cost > rhs.cost;
}

int main() {
	int n, m;
	while(cin >> n >> m, n || m) {
		memset(checked, 0, sizeof(checked));
		vector<int> c(m+1), x(n+1);
		rep(i,m) cin >> c[i];
		rep(i,n) cin >> x[i];
		priority_queue<node> que;
		que.push(node(0, 0, 128));
		while(!que.empty()) {
			node nd = que.top();
			que.pop();
			if( checked[nd.ind][nd.val] ) {
				continue;
			}
			checked[nd.ind][nd.val] = true;
			if( nd.ind == n ) {
				cout << nd.cost << endl;
				break;
			}
			rep(i, m) {
				int nval = min(max(nd.val+c[i], 0), 255);
				que.push(node(nd.cost+(x[nd.ind]-nval)*(x[nd.ind]-nval), nd.ind+1, nval));
			}
		}
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define rep(i,x,y) for(int (i)=(x);i<(y);(i)++)
#define INF 10000000

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

    vector<int> C,x;
    int temp;
    rep(i,0,M){
      cin>>temp;
      C.push_back(temp);
    }
    rep(i,0,N){
      cin>>temp;
      x.push_back(temp);
    }

    vector<vector<int>> dp(N+1,vector<int>(256,INF));
    dp[0][128]=0;
    rep(i,0,N){
      rep(j,0,256){
        if(dp[i][j]==INF){
          continue;
        }
        rep(k,0,M){
          int yn=j+C[k];
          yn=min(255,yn);
          yn=max(0,yn);
          int sum=(x[i]-yn)*(x[i]-yn);
          dp[i+1][yn]=min(dp[i+1][yn],dp[i][j]+sum);
        }
      }
    }

    int ans=dp[N][0];
    rep(i,0,256){
      ans=min(ans,dp[N][i]);
    }
    cout<<ans<<endl;
  }

  return 0;
}