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 <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <cstdlib>
using namespace std;


class DP{
public:
	int cost, n, x;
	int Map[22*22];
	
	DP(){}
	DP(int xx, int nn, int cc){
		cost = cc;x=xx;n=nn;
	}
	
	bool operator< (const DP &opp) const {
		return cost>opp.cost;
	}
};
int C[20];
int x[20001];
bool visit[20001][256];
int N, M;
main(){
	int i,j;
	while(cin >> N >> M, N){
		memset(visit, 0, sizeof(visit));
		for(i=0;i<M;i++) cin >> C[i];
		for(i=0;i<N;i++) cin >> x[i];
		priority_queue<DP> dp;
		DP S;
		dp.push(DP(128, 0, 0));
		while(!dp.empty()){
			S = dp.top();
			dp.pop();

			if(S.n == N) break;
			for(i=0;i<M;i++){
				DP T=S;
				T.x += C[i];
				if(T.x > 255) T.x = 255;
				if(T.x < 0) T.x = 0;
				
				T.cost += (x[T.n]-T.x)*(x[T.n]-T.x);
				T.n ++;
				if(visit[T.n][T.x]) continue;
				visit[T.n][T.x] ++;
				dp.push(T);
			}
		}
		cout << S.cost << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>


using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CLEAR(arr, val) memset(arr, val, sizeof(arr))

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

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

typedef long long ll;
typedef pair<int, int> pint;

const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };



int main()
{
	int n, m, c[32], x[21919];
	while (cin >> n >> m, n)
	{
		for (int i = 0; i < m; ++i)
			cin >> c[i];
		for (int i = 0; i < n; ++i)
			cin >> x[i];

		static ll dp[21919][256];
		const ll INF = 1LL << 55;
		for (int i = 0; i <= n; ++i)
			for (int j = 0; j <= 255; ++j)
				dp[i][j] = INF;

		dp[0][128] = 0;
		for (int i = 0; i < n; ++i)
		{
			for (int j = 0; j <= 255; ++j)
			{
				for (int k = 0; k < m; ++k)
				{
					int y = max(0, min(255, j + c[k]));
					int s = x[i] - y;
					min_swap(dp[i + 1][y], dp[i][j] + s * s);
				}
			}
		}
		cout << *min_element(dp[n], dp[n] + 256) << endl;
	}
}

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

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;

ll n, m;
ll c[100], x[20010];
ll dp[20][30000];

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 20)REP(j, 300)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, m){
				REP(k, 256){
					int num = k + c[j];
					if (num < 0)num = 0;
					if (num > 255)num = 255;
					dp[i + 1][num] = min(dp[i][k] + (x[i] - (num))*(x[i] - (num)), dp[i + 1][num]);
				}
			}
		}
		ll ans = INF;
		//REP(i, n + 1){
		//	cout << i << endl;
		//	FOR(j, 120, 140){
		//		cout << dp[i][j] << " ";
		//	}
		//	cout << endl;
		//}
		REP(i, 300){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}