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 <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
 
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define MCLR(a) memset((a), -1 ,sizeof(a))
#define SZ(a) (sizeof(a))
#define FILL(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v)

bool cheak(int x,int y,int xMax,int yMax)
{return x >= 0 && y >= 0 && xMax > x && yMax > y;}
const int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
const int INF = 2147483647;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

const int MAX = 20020;
int dp[MAX][256];

int main()
{
	int n,m;
	while(cin >> n >> m && n)
	{
		int c[20],x[MAX];
		REP(i,m)cin >> c[i];
		REP(i,n)cin >> x[i];
		
		FILL(dp,INF);
		dp[0][128] = 0;

		REP(i,n)
		REP(j,256)
		if(dp[i][j] != INF)
		REP(k,m)
		{
			int tmp = j+c[k];
			if(tmp < 0)
				tmp = 0;
			if(tmp >= 256)
				tmp = 255;
			
			int val = pow(x[i]-tmp,2);
			if(val < dp[i+1][tmp])
				dp[i+1][tmp] = val+dp[i][j];
		}

		int ans = INF;
		REP(j,256)
		ans = min(dp[n][j],ans);
		
		cout << ans << endl;
	}

	return 0;

}

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
#define MAX_N 20000
#define MAX_M 16

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;

int n, m;
int c[MAX_M + 1], x[MAX_N + 1];
int dp[MAX_N + 1][256 + 1];

int POW(int num){
	return num*num;
}

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, MAX_N + 1){
			REP(j, 256 + 1){
				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, 256){
				if (dp[i][j] == INF)continue;
				REP(k, m){
					int num = j + c[k];
					if (num < 0) num = 0;
					if (num > 255) num = 255;
					dp[i + 1][num] = min(dp[i][j] + POW(x[i] - num), dp[i + 1][num]);
				}
			}
		}
		int ans = INF;
		REP(i, 256){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

C++: #include <iostream>
using namespace std;

int dp[20001][256];
int C[17];

int main() {
    int n, m;
    while(cin>>n>>m, n) {
        for(int i=0; i<20000; ++i)
          for(int j=0; j<256; ++j) dp[i][j] = 1e+9;
        dp[0][128] = 0;
        for(int i=0; i<16; ++i) C[i] = 0;
        for(int i=0; i<m; ++i) cin >> C[i];
        for(int i=1; i<=n; ++i) {
            int x;
            cin >> x;
            for(int j=0; j<256; ++j) {
                for(int k=0; k<m; ++k) {
                    int x2 = j + C[k];
                    if(255<=x2) x2=255;
                    if(x2<=0) x2=0;
                    int diff = (x2-x) * (x2-x);
                    dp[i][x2] = min(dp[i][x2], dp[i-1][j]+diff);
                }
            }
        }

        int ans = 1e+9;
        for(int i=0; i<256; ++i) ans = min(ans, dp[n][i]);
        cout << ans << endl;
    }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

using ll = long long;

#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)

#define input(...) __VA_ARGS__; in(__VA_ARGS__)

template<class T>
void print(vector<T> a) {
  cout << "[ ";
  REP(i, a.size()) cout << a[i] << " ";
  cout << "]" << endl;
}

void print() {
  std::cout << std::endl;
}

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  std::cout << head << " ";
  print(std::forward<Tail>(tail)...);
}

void in() { }

template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
  cin >> head;
  in(std::forward<Tail>(tail)...);
}

ll n, m;
vector<ll> c;
vector<ll> x;
vector<vector<ll>> table;

ll clip(ll x, ll minv, ll maxv) {
  return min(max(x, minv), maxv);
}

ll dfs(ll i, ll y=128) {
  if (table[i][y] != -1) return table[i][y];

  if (i == n) return table[i][y] = 0;

  ll minv = 1ll << 60;
  for (auto v: c) {
    ll value = clip(y + v, 0, 255);
    ll diff = value - x[i];
    minv = min(minv, dfs(i + 1, value) + diff * diff);
  }
  return table[i][y] = minv;
}

bool solve() {
  cin >> n >> m;
  if (n == 0 && m == 0) return false;

  c = vector<ll>(m);
  x = vector<ll>(n);
  REP(i, m) cin >> c[i];
  REP(i, n) cin >> x[i];
  table = vector<vector<ll>>(n + 1, vector<ll>(256, -1));

  cout << dfs(0) << endl;
  return true;
}

int main() {
  while(solve());
}