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 FOR(i,s,t) for(int i = s; i < t ; i++)
using LL = long long; using VL = vector<LL>;
template<class T> using V = vector<T>; template<class T> using VV = V<V<T>>;
const LL LINF = 1e18;

LL dist[20004][260];
inline int cha(int s) {
	if (s >= 255)return 255;
	if (s <= 0)return 0;
	return s;
}
inline LL cost(int y,int x) {
	return (y - x)*(y - x);
}
void init() {
	fill(*dist, *dist + 20004 * 260, LINF);
}
void solve() {
	int N, M;
	while (cin >> N >> M, N) {
		init();
		V<int> c(M);
		FOR(i, 0, M) {
			cin >> c[i];
		}
		V<int>x(N);
		FOR(i, 0, N) {
			cin >> x[i];
		}
		// dpとかdijkstraっぽく
		dist[0][128] = 0;
		FOR(i, 0, N) {
			FOR(j, 0, M) {
				FOR(p, 0, 260) {
					dist[i + 1][cha(p + c[j])] = min(
						dist[i + 1][cha(p + c[j])],
						dist[i][cha(p)] + cost(x[i] , cha(p+c[j])));
				}
			}
		}
		LL ans = LINF;
		FOR(i, 0, 260) {
			ans = min(ans, dist[N][i]);
		}
		cout << ans << endl;
	}	


}

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

	solve();

	return 0;
}

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

#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)

#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>

#define MOD 1000000007
#define INF 1000000000000000LL

using namespace std;

#define MAXM 16

ll dp[2][256];

ll makein(ll n){
  if(n<0)return 0;
  if(n>255)return 255;
  return n;
}

void solve(ll n, ll m){
  ll *now=dp[0];
  ll *nex=dp[1];
  
  rep(i, 256)nex[i]=now[i]=INF;
  now[128]=0;

  vector<ll> c(m);
  rep(i, m)cin>>c[i];

  vector<ll> x(n);
  rep(i, n)cin>>x[i];

  rep(i, n){
    rep(i, 256)nex[i]=INF;

    rep(from, 256)for(auto code: c){
      ll coded = makein(from+code);
      ll sq = (coded - x[i])*(coded - x[i]);
      nex[coded]=min(nex[coded],now[from]+sq);
    }
    swap(nex, now);
  }
  ll result = INF;
  rep(i, 256)result = min(result, now[i]);
  cout<<result<<endl;
}

int main(){
  while(true){
    ll n,m;cin>>n>>m;
    if(n==0)break;
    solve(n, m);
  }

  return 0;
}