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;
typedef long long ll;

ll dp[20001][256];
int c[16];
ll x[20000];
int main()
{
	while(1)
	{
		fill(dp[0],dp[20001],1e15-1);
		int n,m;
		cin>>n>>m;
		if(n==0)
			break;
		for(int i=0;i<m;i++)
			cin>>c[i];
		for(int i=0;i<n;i++)
			cin>>x[i];
		dp[0][128]=0;
		for(int i=1;i<n+1;i++)
		{
			for(int j=0;j<256;j++)
			{
				if(dp[i-1][j]!=1e8-1)
				{
					for(int k=0;k<m;k++)
					{
						ll tmp=j+c[k];
						tmp=max(0LL,tmp);
						tmp=min(255LL,tmp);
						dp[i][tmp]=min(dp[i][tmp],dp[i-1][j]+(x[i-1]-tmp)*(x[i-1]-tmp));
					}
				}
			}
		}
		ll ans=dp[n][0];
		for(int i=0;i<256;i++)
			ans=min(ans,dp[n][i]);
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define INF (1 << 30)

int dp[20001][256];


int main()
{
  int N, M;
  while(cin >> N >> M, N || M){
    int C[16], x[20000];
    for(int i = 0; i < M; i++) cin >> C[i];
    for(int i = 0; i < N; i++) cin >> x[i];
    for(int i = 0; i < 20001; i++){
      for(int j = 0; j < 256; j++) dp[i][j] = INF;
    }
    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 y = j + C[k];
	  if(y < 0) y = 0;
	  else if(y > 255) y = 255;
	  int sqsum = (x[i] - y)*(x[i] - y);
	  dp[i+1][y] = min(dp[i+1][y], dp[i][j] + sqsum);	  
	}
      }
    }
    cout << *min_element(dp[N], dp[N] + 256) << endl;
  }
  return 0;
}

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

using namespace std;

#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()
const int inf = 1 << 28;

template<typename T> inline void chmin(T& t, T f){if(t > f)t = f;}
template<typename T> inline T sqr(T x){return x * x;}

int N, M;

int solve(vector<int>& Cs, vector<int>& xs){
    vector<int> dp(256, inf); dp[128] = 0;
    rep(i, N){
        vector<int> nxt(256, inf);
        rep(y, 256)if(dp[y] != inf){
            rep(j, M){
                int ny = max(0, min(y + Cs[j], 255));
                chmin(nxt[ny], dp[y] + sqr(xs[i] - ny));
            }
        }
        dp.swap(nxt);
    }
    return *min_element(all(dp));
}

int main(){
    while(cin >> N >> M, N|M){
        vector<int> Cs(M), xs(N);
        rep(i, M)cin >> Cs[i];
        rep(i, N)cin >> xs[i];
        cout << solve(Cs, xs) << '\n';
    }
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <complex>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <stack>
#include <cmath>
#include <iomanip>
#include <sstream>
#include <cassert>

using namespace std;

typedef long long ll;
typedef ll li;
typedef pair<int,int> PI;
#define EPS (1e-10L)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(),a.end()
#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)
void pkuassert(bool t){t=1/t;};
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,-1,1,1,-1};

int n,m;
int c[16];


bool vis[256][20001];

void solve(){
  rep(i,m) cin >> c[i];
  int x[n];
  rep(i,n) cin >> x[i];
  priority_queue<pair<int,PI> > q;
  q.push(mp(0,mp(0,128)));
  memset(vis,0,sizeof(vis));
  while(!q.empty()){
    int cc=-q.top().F;
    int ne=q.top().S.F;
    int cv=q.top().S.S;
    q.pop();
    if(ne==n){
      cout << cc << endl;
      return;
    }
    
    if(vis[cv][ne]) continue;
    vis[cv][ne]=true;
    rep(j,m){
      ll nv=cv+c[j];
      nv=max(nv,0LL);
      nv=min(nv,255LL);
      if(vis[nv][ne+1]) continue;
      q.push(mp(-cc-(nv-x[ne])*(nv-x[ne]),mp(ne+1,nv)));
    }
  }
}

int main(int argc, char *argv[])
{
  while(cin >> n >> m && n) solve();
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#define INF 100000000

using namespace std;

int main(void) {
	int N,M;
	while (cin >> N >> M, N) {
		vector<int> C(M);
		for (int i = 0; i < M; ++i) {
			cin >> C[i];
		}
		vector<int> x(N);
		for (int i = 0; i < N; ++i) {
			cin >> x[i];
		}

		vector< vector<int> > dp(256,vector<int>(N+1));
		for (int i = 0; i < 256; ++i) {
			for (int j = 0; j < N+1; ++j) {
				dp[i][j] = INF;
			}
		}
		dp[128][0] = 0;

		for (int j = 0; j < N; ++j) {
			for (int i = 0; i < 256; ++i) {
				if (dp[i][j] != INF) {
					for (int k = 0; k < M; ++k) {
						if (C[k]+i > 255) {
							dp[255][j+1] = min(dp[255][j+1],dp[i][j]+(int)pow(x[j]-255,2));
						}
						else if (C[k]+i < 0) {
							dp[0][j+1] = min(dp[0][j+1],dp[i][j]+(int)pow(x[j]-0,2));
						}
						else {
							dp[C[k]+i][j+1] = min(dp[C[k]+i][j+1],dp[i][j]+(int)pow(x[j]-C[k]-i,2));
						}
					}
				}
			}
		}

		int res = INF;
		for (int i = 0; i < 256; ++i) {
			if (dp[i][N] < res) {
				res = dp[i][N];
			}
		}
		cout << res << endl;
	}
	return 0;
}