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 <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<ll,PI> > q;
  q.push(mp(0,mp(0,128)));
  memset(vis,0,sizeof(vis));
  ll tans=0;
  int y0=128;
  rep(i,n){
    int mini=0;
    int minv=1000000000;
    rep(j,m){
      int nv=y0+c[j];
      nv=max(nv,0);
      nv=min(nv,255);
      if(minv>abs(nv-x[j])){
        mini=j;
        minv=abs(nv-x[j]);
      }
    }
    int nv=y0+c[mini];
    nv=max(nv,0);
    nv=min(nv,255);
    tans+=(nv-x[i])*(nv-x[i]);
  }
  while(!q.empty()){
    ll 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(tans<=cc) continue;
    if(vis[cv][ne]) continue;
    vis[cv][ne]=true;
    rep(j,m){
      int nv=cv+c[j];
      nv=max(nv,0);
      nv=min(nv,255);
      if(vis[nv][ne+1]) continue;
      q.push(mp(-cc-(nv-x[ne])*(nv-x[ne]),mp(ne+1,nv)));
    }
  }
  cout << tans << endl;
}

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

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  while(true){
      int n,m;cin>>n>>m;
      if(n==0 && m==0) break;
      std::vector<int> c(m),x(n+1);
      for(int i=0;i<m;i++) cin>>c[i];
      for(int i=1;i<=n;i++) cin>>x[i];
      ll dp[n+1][256];
      for(int i=0;i<n+1;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++){
          for(int k=0;k<m;k++){
              if(j+c[k]>255) dp[i+1][255]=min(dp[i+1][255],dp[i][j]+(255-x[i+1])*(255-x[i+1]));
              else if(j+c[k]<0) dp[i+1][0]=min(dp[i+1][0],dp[i][j]+(x[i+1])*(x[i+1]));
              else dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j]+(j+c[k]-x[i+1])*(j+c[k]-x[i+1]));
          }
      }
      ll res=INF;
      for(int i=0;i<256;i++) res=min(res,dp[n][i]);
      cout<<res<<endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
	while (1) {
		int n, m; cin >> n >> m;
		if (n==0 && m==0) return 0;
		vector<ll> c(m); for (int i=0; i<m; i++) cin >> c[i];
		vector<ll> x(n); for (int i=0; i<n; i++) cin >> x[i];
		vector<vector<ll> > dp(n+1, vector<ll>(256, 1000000000000));
		dp[0][128] = 0;
		for (int i = 0; i < n; ++i)
		{
			for (int j = 0; j < 256; ++j)
			{
				for (int k = 0; k < m; ++k)
				{
					if (j+c[k] < 0) dp[i+1][0] = min(dp[i+1][0], dp[i][j]+x[i]*x[i]);
					else if (j+c[k] > 255) dp[i+1][255] = min(dp[i+1][255], dp[i][j]+(255-x[i])*(255-x[i]));
					else dp[i+1][j+c[k]] = min(dp[i+1][j+c[k]], dp[i][j]+(x[i]-(j+c[k]))*(x[i]-(j+c[k])));
				}
			}
		}
		ll ans = 1000000000000;
		for (int j = 0; j < 256; ++j)
		{
			ans = min(ans, dp[n][j]);
		}
		cout << ans << endl;
	}
}

C++: //Yattazo! Watashiha-Yosen-tsuukashita! It's 460points/600points! OHO!!!!!
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int x[63000][260],n,m,y[63000],z[63000],d,minx;
int main(){
	while(true){
		minx=2000000000;
		for(int i=0;i<65536;i++){for(int j=0;j<256;j++){x[i][j]=2000000000;}}
		cin>>n>>m;if(!n){break;}
		for(int i=0;i<m;i++){cin>>y[i];}
		for(int i=1;i<=n;i++){cin>>z[i];}
		x[0][128]=0;
		for(int i=1;i<=n;i++){
			for(int j=0;j<256;j++){
				if(x[i-1][j]<1000000000){
					for(int k=0;k<m;k++){
						d=y[k]+j;
						if(d<0){d=0;}
						if(d>255){d=255;}
						x[i][d]=min(x[i][d],x[i-1][j]+(int)pow(1.0*(z[i]-d),2));
					}
				}
			}
		}
		for(int i=0;i<256;i++){minx=min(minx,x[n][i]);}
		cout<<minx<<endl;
	}
}