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 <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define sq(x) ((x)*(x))
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
int N,M;
int C[20];
int x[20010];
ll dp[20010][256];
int solve(){
    scanf("%d %d",&N,&M);
    if(N==0&&M==0)return 1;
    for(int i=0;i<M;i++)scanf("%d",&C[i]);
    for(int i=0;i<N;i++)scanf("%d",&x[i]);
    for(int i=0;i<=N;i++){
        for(int j=0;j<256;j++){
            dp[i][j]=LLINF;
        }
    }
    dp[0][128]=0;
    for(int i=0;i<N;i++){
        for(int j=0;j<256;j++){
            if(dp[i][j]==LLINF)continue;
            for(int k=0;k<M;k++){
                int nxt = j+C[k];
                nxt = max(0,nxt);
                nxt = min(255,nxt);
                dp[i+1][nxt]=min(dp[i+1][nxt],(ll)(dp[i][j]+sq(abs(nxt-x[i]))));
            }
        }
    }
    ll ans = LLINF;
    for(int i=0;i<256;i++)ans = min(ans,dp[N][i]);
    cout << ans << endl;
    return 0;
}
int main(){
    while(1){
        if(solve())return 0;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

int c[16], x[16];
int dp[20001][256];
int d(int a) {
	if (a < 0)return 0;
	if (a > 255)return 255;
	return a;
}
int diff(int i, int a) {
	return (x[i] - a)*(x[i] - a);
}
signed main() {
	int n, m;
	while (scanf("%lld%lld", &n, &m), n) {
		rep(i, m)scanf("%lld", &c[i]);
		rep(i, n)scanf("%lld", &x[i]);
		memset(dp, 0x3f, sizeof(dp));
		dp[0][128] = 0;
		rep(i, n)rep(j, 256) {
			if (dp[i][j] == INF)continue;
			rep(k, m) {
				int a = d(j + c[k]);
				dp[i + 1][a] = min(dp[i + 1][a], dp[i][j] + diff(i, a));
			}
		}
		int Min = INF;
		rep(j, 256)Min = min(Min, dp[n][j]);
		printf("%lld\n", Min);
	}
}

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,0,MID+1){
                rep(k,m){
                    int nj;
                    if(j+c[k]>255) nj=255;
                    else if(j+c[k]<0) nj=0;
                    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;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <sstream>

using namespace std;

long long int DP[20001][256];

int main(){
	
	int N, M;
	
	while(true){
		cin >> N >> M;
		if(N == 0){
			break;
		}
		
		int C[20];
		
		for(int i = 0; i < M; i++){
			cin >> C[i];
		}
		
		long long int x[20001];
		
		for(int i = 0; i < N; i++){
			cin >> x[i];
		}
		
		for(int i = 0; i <= N; i++){
			for(int j = 0; j < 256; j++){
				DP[i][j] = 100000000000;
			}
		}
		
		DP[0][128] = 0;
		
		for(int i = 0; i < N; i++){
			for(int j = 0; j < M; j++){
				for(int k = 0; k < 256; k++){
					int index = max(0, min(255, k + C[j]));
					DP[i + 1][index] = min(DP[i + 1][index], DP[i][k] + (x[i] - index) * (x[i] - index));
				}
			}
		}
		
		long long int ans = 100000000000;
		
		for(int i = 0; i < 256; i++){
			ans = min(ans, DP[N][i]);
		}
		
		cout << ans << endl;
		
	}
	
	return 0;
}