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 inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265

int dp[21000][300];

void f(int n,int m){

  rep(i,n+1){
    rep(j,300){
      dp[i][j] = inf;
    }
  }
  int c[1000];
  rep(i,m){
    cin>>c[i];
  }

  dp[0][128]=0;

  FOR(i,1,n+1){
    int x;
    cin>>x;
    rep(j,256){
      rep(k,m){
        int a = j+c[k];
        a = min(255,a);
        a = max(0,a);
        int d = (a-x)*(a-x);
        dp[i][a] = min(dp[i][a],dp[i-1][j]+d);
      }
    }

  }
  int ans = inf;
  rep(i,256){
    ans = min(ans,dp[n][i]);
  }

  cout<<ans<<endl;

}

int main(){
  while(1){
    int n,m;
    cin>>n>>m;
    if(n==0&&m==0) break;
    f(n,m);
  }

  return 0;
}

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=INF;
    int dp[n+20][530]={};
    for(int i=0;i<n+2;i++)
      for(int j=0;j<530;j++)
	dp[i][j]=INF;
    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=0;j<530;j++){
	if(dp[i-1][j]!=INF){
	  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<530;i++){
      ans=min(dp[n][i],ans);
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>

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; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll C[20];
ll x[25000];
ll dp[25000][260];
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	while (1) {
		ll N, M; scanf("%lld %lld", &N, &M);
		if (N == 0 && M == 0) break;
		for (ll i = 0; i < M; i++) scanf("%lld", &C[i]);
		for (ll i = 0; i < N; i++) scanf("%lld", &x[i]);
		for (ll i = 0; i <= N + 1; i++) for (ll j = 0; j < 260; j++) dp[i][j] = INF;
		dp[0][128] = 0;
		for (ll i = 0; i < N; i++) {
			for (ll j = 0; j <= 255; j++) {
				if (dp[i][j] == INF) continue;
				for (ll k = 0; k < M; k++) {
					ll next = j + C[k];
					chmin(next, 255LL);
					chmax(next, 0LL);
					chmin(dp[i + 1][next], dp[i][j] + (x[i] - next) * (x[i] - next));
				}
			}
		}
		ll res = INF;
		for (ll i = 0; i <= 255; i++) chmin(res, dp[N][i]);
		printf("%lld\n", res);
	}
	return 0;
}

C++: #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>


#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rREP(i, k, n) for (int i = (int)(n)-1; i >= k; i--)

#define debug(x) cerr<<#x<<": "<<x<<endl;

#define fi first
#define se second

#define vi vector<int>
#define pb push_back
#define mp make_pair

#define pcnt __builtin_popcount

typedef long long ll;
const ll inf = 900900900100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int MID=255;
using namespace std;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int n,m;
    while(cin >> n >> m,n){
        vector<int> c(m);
        rep(i,m) cin >> c[i];
        vector<int> x(n+1);
        rep(i,n) cin >> x[i+1];
        x[0] = 128;
        vector<vector<ll> > dp(20100,vector<ll> (MID*3,inf));
        REP(j,-MID,MID+1) dp[0][j+MID] = 0;
        rep(i,n+1){
            REP(j,-MID,MID+1){
                rep(k,m){
                    int nj;
                    if(j+c[k]>255) nj=255;
                    else if(j+c[k]<-255) nj=-255;
                    else nj = j+c[k];
                    dp[i+1][nj+MID]=min<ll>(dp[i+1][nj+MID],dp[i][j+MID]+(nj-x[i])*(nj-x[i]));
                }
            }
        }
        ll ans = inf;
        REP(i,-MID,MID+1) ans = min<ll>(dp[n+1][i+MID],ans);
        cout << ans << endl;
    }

    return 0;
}