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 <vector>
#include <algorithm>

#define IF 3040401
#define lengthof(x) (sizeof(x) / sizeof(*(x)))

using namespace std;

int main(int argc, char const *argv[])
{
	int n,m;
	int dp[1<<8][2];
	int min_;

	while(1){
		cin>>n>>m;
		if(n+m==0) break;

		vector<int> cb(m);
		vector<int> x(n);
		for(int i1=0;i1<m;i1++){
			cin>>cb[i1];
		}

		for(int i1=0;i1<n;i1++){
			cin>>x[i1];
		}

		fill((int*)dp,(int *)(dp+lengthof(dp)),IF);

		dp[128][0]=0;
		for(int i1=0;i1<n;i1++){
			for(int i2=0;i2<(1<<8);i2++){
				if(dp[i2][i1%2]!=IF){

					for(int i3=0;i3<m;i3++){
						int temp=i2+cb[i3];
						if(temp<0) temp=0;
						if(temp>255) temp=255;
						dp[temp][(i1+1)%2]=min(dp[temp][(i1+1)%2],dp[i2][i1%2]+(temp-x[i1])*(temp-x[i1]));
					}
					dp[i2][i1%2]=IF;
				}

			}
		}

		min_=IF;
		for(int i1=0;i1<(1<<8);i1++){
			min_=min(min_,dp[i1][n%2]);
		}

		cout<<min_<<endl;
	}
	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<bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); i++)
#define ll long long
using namespace std;

const ll INF=1e18+7;

int f(int x) { return max(0, min(x, 255)); }

int main() {
  int n,m; 

  while (1) {
    cin>>n>>m;
    if (n==0&&m==0) break;
    vector<int> c(m),x(n);
    rep(i, m) cin>>c[i];
    rep(i, n) cin>>x[i];

    vector<vector<ll>> dp(n+1, vector<ll>(256, INF));
    dp[0][128]=0;
    rep(i, n) {
      rep(j, 256) {
        if (dp[i][j]==INF) continue;
          rep(k, m) {
          int y=f(j+c[k]);
          dp[i+1][y]=min(dp[i+1][y], dp[i][j]+(ll)(x[i]-y)*(ll)(x[i]-y));
        }
      }
    }
    ll res=INF;
    rep(i, 256) res=min(res, dp[n][i]);
    cout<<res<<endl;
  }
}

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

int n, m;
int c[16], x[20001];

ll dp[20001][256];

ll rec(int p, int y) {
    if (dp[p][y] >= 0) return dp[p][y];

    if (p == n) return 0;

    ll ret=1e10;
    for (int i=0; i<m; ++i) {
        int ny=y+c[i];
        if (ny<0) ny=0;
        else if (ny>255) ny=255;
        ret = min(ret, rec(p+1, ny)+(ny-x[p])*(ny-x[p]));
    }

    return dp[p][y] = ret;
}

int main() {
    while (cin >> n >> m and (n or m)) {
        rep(i,m) cin >> c[i];
        rep(i,n) cin >> x[i];
        fill(dp[0], dp[20001], -1);
        cout << rec(0, 128) << endl;
    }
}

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

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30

using namespace std;
typedef long long ll;

int dp[200005][300];

int main()
{
    int n,m;
    while(cin >> n >> m) {
        if(n == 0 && m == 0) break;

        vector<int> c(m);
        rep(i,m) cin >> c[i];

        vector<int> x(n);
        rep(i,n) cin >> x[i];

        rep(i,n+1) rep(j,300) dp[i][j] = INF;

        dp[0][128] = 0;

        REP(i,1,n+1) {
            rep(j,256) {
                if(dp[i-1][j] == INF) continue;

                rep(k,m) {
                    int to = j + c[k];
                    to = max(to,0);
                    to = min(to,255);

                    int ret = (x[i-1]-to) * (x[i-1]-to);
                    dp[i][to] = min(dp[i][j],dp[i-1][j] + ret);
                }
            }
        }

        int ans = INF;
        rep(i,300) ans = min(ans,dp[n][i]);

        cout << ans << endl;
    }

    return 0;
}

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

int main()
{
  int N,M,C[17],x[20002],y,a,b;
  pair<long long,int> DP[2][256];
  long long mi;

  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++)cin>>C[i];
    for(int i=1;i<N+1;i++)cin>>x[i];
    for(int i=0;i<256;i++){
      DP[0][i].first=0;
      DP[0][i].second=128;
    }

    for(int i=1;i<N+1;i++){
      for(int j=0;j<M;j++){
	for(int n=0;n<M;n++){
	  mi=100000001;
	  for(int m=0;m<M;m++){
	    b=C[j]+DP[(i-1)%2][n*M+m].second;
	    if(b<0)b=0;
	    if(b>255)b=255;
	    a=x[i]-b;
	    a=a*a;
	    a+=DP[(i-1)%2][n*M+m].first;
	    if(mi>a){
	      mi=a;
	      y=b;
	    }
	  }
	  DP[i%2][j*M+n].first=mi;
	  DP[i%2][j*M+n].second=y;
	}
      }
    }
    for(int i=0;i<M*M;i++){
      if(N%2==0)mi=min(mi,DP[0][i].first);
      else mi=min(mi,DP[1][i].first);
    }
    cout<<mi<<endl;
  }
  return 0;
}