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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>

using namespace std;

#define P(a) (a) * (a)

typedef unsigned uint;
typedef long long Int;

const int INF = 1001001001;
const Int INFLL = 1001001001001001001LL;

template<typename T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<typename T> void chmin(T& a, T b) { if (a > b) a = b; }
template<typename T> void chmax(T& a, T b) { if (a < b) a = b; }

int c[20], x[20500];
int dp[20500][256];
// dp[x][y]

int main()
{
	int n, m;
	while (cin >> n >> m, n && m){
		for (int i = 0; i < m; i++){
			cin >> c[i];
		}
		for (int i = 0; i < n; i++){
			cin >> x[i];
		}
		memset(dp, INF, sizeof(dp));

		dp[0][128] = 0;
		for (int i = 0; i < n; i++){
			for (int j = 0; j < 256; j++){
				if (dp[i][j] == INF) continue;
				for (int k = 0; k < m; k++){
					int next = j + c[k];
					next = min(next, 255);
					next = max(next, 0);
					dp[i + 1][next] = min(dp[i + 1][next], dp[i][j] + P(x[i] - next));
					// cout << dp[i+1][next] << " ";
				}
				// puts("");
			}
		}

		int ret = INF;
		for (int j = 0; j < 256; j++){
			ret = min(ret, dp[n][j]);
		}
		cout << ret << endl;
	}

    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

struct node {
	int cost;
	int ind;
	int val;
	node(int c, int i, int v) {
		cost = c;
		ind = i;
		val = v;
	}
};

bool operator<(const node& lhs, const node& rhs) {
	if( lhs.cost == rhs.cost ) {
		return lhs.ind < rhs.ind;
	}
	return lhs.cost > rhs.cost;
}

int main() {
	int n, m;
	while(cin >> n >> m, n || m) {
		vector<int> c(m), x(n);
		rep(i,m) cin >> c[i];
		rep(i,n) cin >> x[i];
		priority_queue<node> que;
		que.push(node(0, 0, 128));
		while(!que.empty()) {
			node nd = que.top();
			que.pop();
			if( nd.ind == n ) {
				cout << nd.cost << endl;
				break;
			}
			rep(i, m) {
				int nval = min(max(nd.val+c[i], 0), 255);
				que.push(node(nd.cost+(x[nd.ind]-nval)*(x[nd.ind]-nval), nd.ind+1, nval));
			}
		}
	}
	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);
        rep(i,n) cin >> x[i];
        vector<vector<ll> > dp(20100,vector<ll> (MID*3,inf));
        dp[0][128+MID] = 0;
        rep(i,n){
            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][i+MID],ans);
        cout << ans << endl;
    }

    return 0;
}