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

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
#define MAX_N 20000
#define MAX_M 16

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, m;
int c[MAX_M + 1], x[MAX_N + 1];
int dp[MAX_N + 1][256 + 1];

int POW(int num){
	return num*num;
}

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, MAX_N + 1){
			REP(j, 256 + 1){
				dp[i][j] = INF;
			}
		}
		REP(i, m) cin >> c[i];
		REP(i, n) cin >> x[i];
		dp[0][128] = 0;
		REP(i, n){
			REP(j, 256){
				if (dp[i][j] == INF)continue;
				REP(k, m){
					int num = j + c[k];
					if (num < 0) num = 0;
					if (num > 255) num = 255;
					dp[i + 1][num] = min(dp[i][j] + POW(x[i] - num), dp[i + 1][num]);
				}
			}
		}
		int ans = INF;
		REP(i, 256){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

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

using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const ll INF = 1LL<<60;
// const ll m=1LL<<32;

int main(){

  ll n,m;
  while(cin>>n>>m){
    if(n==m&&m==0)break;
    ll c[m];rep(i,0,m)cin>>c[i];
    ll x[n];rep(i,0,n)cin>>x[i];
    ll dp[n+1][256];
    rep(i,0,n+1)rep(j,0,256)dp[i][j]=INF;
    dp[0][128]=0;
    rep(i,1,n+1){
      rep(j,0,m){
        rep(k,0,256){
          if(dp[i-1][k]!=INF){
            ll p=k+c[j];
            if(p<0)p=0;
            if(p>255)p=255;
            ll num=abs(p-x[i-1]);
            chmin(dp[i][p],dp[i-1][k]+num*num);
          }
        }
      }
    }
    ll ans=INF;
    rep(i,0,256){
      chmin(ans,dp[n][i]);
    }

    out(ans);
  }




  return 0;
}

C++: #include<iostream>
#include<algorithm>
#define NUM 256
using namespace std;

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int dp[3000][NUM];
    for(int i=0;i<=n;i++)
      for(int j=0;j<NUM;j++)
	dp[i][j]=1<<30;
    dp[0][128]=0;
    int c[20],x[3000];
    for(int i=0;i<m;i++)cin>>c[i];
    for(int i=0;i<n;i++)cin>>x[i];
    
    for(int i=0;i<n;i++){
      for(int j=0;j<NUM;j++){
	for(int k=0;k<m;k++){
	  if(j+c[k]<0){
	    dp[i+1][0]=min(dp[i+1][0],dp[i][j] + x[i]*x[i]);
	  }else if(j+c[k]>255){
	    dp[i+1][255]=min(dp[i+1][255],dp[i][j] + (x[i]-255)*(x[i]-255));
	  }else{
	    dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j] + (x[i]-j-c[k])*(x[i]-j-c[k]));
	  }
	}
      }
    }
    // for(int j=0;j<256;j++){
    //   for(int i=0;i<n;i++){
    // 	cout << dp[i][j] << " ";
    //   }
    //   cout << endl;
    // }

    int res=1<<30;
    for(int i=0;i<NUM;i++)res=min(res,dp[n][i]);
    cout << res << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;

template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}

void solve() {
    int n, m;
    cin >> n >> m;
    if(n == 0 && m == 0) exit(0);
    vi c(m);
    rep(i, m) cin >> c[i];
    vi x(n);
    rep(i, n) cin >> x[i];
    vl cur(256, INF);
    cur[128] = 0;
    rep(i, n) {
        vl nxt(cur.size(), INF);
        rep(j, 256) rep(k, m) {
            int y = j + c[k];
            if(y < 0) y = 0;
            if(y > 255) y = 255;
            chmin(nxt[y], cur[j] + (x[i] - y)*(x[i] - y));
        }
        swap(cur, nxt);
    }
    cout << *min_element(all(cur)) << endl;
}

int main(){
    while(1) solve();
}