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;
using ll = long long;

template<class T>
void chmin(T &a, T b) {if (a > b) a=b;}

constexpr ll INF = 1ll<<60;
ll N, M;
ll C[20], X[20010];
ll dp[20010][270];

void init()
{
	for (ll i = 0; i < 20010; ++i)
		for (ll j = 0; j < 270; ++j)
			dp[i][j] = INF;
}

ll round(ll a)
{
	if (a < 0) return 0;
	else if (a > 255) return 255;
	else return a;
}

ll dist(ll a, ll b)
{
	return pow(a-b, 2);
}

int main(int argc, char **argv)
{
	while (true)
	{
		cin >> N >> M;
		if (N == 0 && M == 0) break;
		for (ll i = 0; i < M; ++i) cin >> C[i];
		for (ll i = 0; i < N; ++i) cin >> X[i];
		init();
		for (ll i = 0; i < M; ++i) dp[0][round(128+C[i])] = dist(round(128+C[i]), X[0]);

		for (ll n = 0; n < N; ++n)
		{
			for (ll a = 0; a <= 255; ++a)
			{
				for (ll m = 0; m < M; ++m)
				{
					ll tmp = round(a+C[m]);
					chmin(dp[n+1][tmp], dp[n][a]+dist(tmp, X[n+1]));
				}
			}
		}
		ll res{INF};
		for (ll i = 0; i <= 255; ++i) chmin(res, dp[N-1][i]);
		std::cout << res << std::endl;
		
	}
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}

struct Info {
    int val;
    int sum;
    Info() {}
    Info(int v, int s) {
	val = v;
	sum = s;
    }
    bool operator< (const Info &a) const {
	return sum < a.sum;
    }
};

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

	vector<int> C, x;
	inputVector(C, M);
	inputVector(x, N);

	vector<Info> v, w;
	v.push_back(Info(128, 0));
	rep(i, N) {
	    w.clear();
	    rep(j, v.size()) {
		rep(k, M) {
		    Info info = v[j];
		    info.val += C[k];
		    if (info.val > 255) info.val = 255;
		    else if (info.val < 0) info.val = 0;
		    info.sum += (x[i] - info.val) * (x[i] - info.val);
		    w.push_back(info);
		}
	    }
	    sort(all(w));
	    if (w.size() > 100) w.resize(100);
	    swap(v, w);
	}
	cout << v[0].sum << endl;
    }

    return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int n, m;
	while (cin>>n>>m,n) {
		vi cb(m);
		REP(i, m)
			cin >> cb[i];
		vi os(n);
		REP(i, n)
			cin >> os[i];
		vi memo(256,1000000000);
		memo[128] = 0;
		REP(i, n) {
			vi copy(256, 1000000000);
			REP(j, 256) {
				if (memo[j] != 1000000000) {
					REP(k, m) {
						copy[min(255, max(0, j + cb[k]))] =min(copy[min(255, max(0, j + cb[k]))], memo[j] + (os[i] - min(255, max(0, j + cb[k])))*(os[i] - min(255, max(0, j + cb[k]))));
					}
				}
			}
			memo = copy;
		}
		int ans = 1e9;
		REP(i, 256)
			ans = min(ans, memo[i]);
		cout << ans << endl;
	}
}