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;
int dp[2][256];
const int INF=1e9;
int N,M;
int val[20000],c[16];

inline int conv(int v){
    return max(min(v,255),0);
}

void solve(){
    fill_n(*dp,2*256,INF);
    dp[0][128]=0;
    int *prev=dp[0],*next=dp[1];

    for(int i=0;i<N;i++){
        for(int j=0;j<256;j++){
            if(prev[j]==INF)continue;
            for(int k=0;k<M;k++){
                int t=conv(j+c[k]);
                int v=(t-val[i])*(t-val[i]);

                next[t]=min(next[t],prev[j]+v);
            }
            prev[j]=INF;
        }
        swap(prev,next);
    }

    printf("%d\n",*min_element(dp[N&1],dp[N&1]+256));

}

int main(){
    while(scanf("%d%d",&N,&M),N||M){
        for(int i=0;i<M;i++)scanf("%d",&c[i]);
        for(int i=0;i<N;i++)scanf("%d",&val[i]);
        solve();
    }
    return 0;
}

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

int main(){
  int i,j,k,n,m;
  while(cin >> n >> m && n && m){
    vector<int> C,x;
    for(i=0;i<m;i++){
      int a;
      cin >> a;
      C.push_back(a);
    }
    for(i=0;i<n;i++){
      int a;
      cin >> a;
      x.push_back(a);
    }

    unsigned long long y[256][2];
    bool f[256][2];
    for(i=0;i<256;i++){
      y[i][0] = y[i][1] = 0;
      f[i][0] = f[i][1] = false;
    }
    f[128][0] = true;

    for(i=0;i<n;i++){
      for(j=0;j<m;j++){
	for(k=0;k<256;k++){
	  if(f[k][0]){
	    int a = k + C[j];
	    if(a < 0) a = 0;
	    else if(a > 255) a = 255;

	    if(y[k][0] >= (unsigned long long)(2*pow(2.0,63))-1) continue;

	    if(!f[a][1]) y[a][1] = y[k][0]+(x[i]-a)*(x[i]-a);
	    else y[a][1] = min(y[a][1],y[k][0]+(x[i]-a)*(x[i]-a));
	    f[a][1] = true;
	  }
	}
      }
      for(j=0;j<256;j++){
	y[j][0] = y[j][1];
	y[j][1] = 0;
	f[j][0] = f[j][1];
	f[j][1] = false;
      }
    }

    unsigned long long ans = 0;
    bool f2 = false;
    for(i=1;i<256;i++){
      if(f[i][0]){
	if(!f2){
	  ans = y[i][0];
	  f2 = true;
	}
	else ans = min(ans,y[i][0]);
      }
    }
    cout << ans << endl;
  }
  return 0;
}

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

int main(void){
	int n, m;
	while(1){
		cin >> n >> m;
		if(!n&&!m) break;
		vector<int> c(m), x(n);
		for(int i = 0; i < m; ++i){
			cin >> c[i];
		}
		for(int i = 0; i < n; ++i){
			cin >> x[i];
		}
		vector<vector <int>> dp(n+2);
		for(int i = 0; i < n+2; ++i){
			dp[i].resize(256);
			for(int j = 0; j < 256; ++j){
				dp[i][j] = INT_MAX;
			}
		}
		dp[0][128]=0;
		for(int i = 1; i <= n; ++i){
			for(int j = 0; j < m; ++j){
				for(int k = 0; k < 256; ++k){
					if(dp[i-1][k]==INT_MAX) continue;
					int next = k+c[j];
					if(next > 255) next = 255;
					if(next < 0) next = 0;
					dp[i][next] = min(dp[i][next], dp[i-1][k] + (int)pow(x[i-1]-next,2));
				}
			}
		}
		int ans = INT_MAX;
		for(int i = 0; i < 256; ++i){
			ans = min(ans, dp[n][i]);
			//cout << dp[n][i] << " ";
		}
		cout << ans << endl;
	}
	return 0;
}

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


using namespace std;

#define rep(i, n) for (int i = 0; i < n; i++)
#define vec vector

int main(void)
{
	while(1) {
		int n, m;
		cin >> n >> m;
		if (n == 0 && m == 0) break;
		vec<int> c(m), x(n + 1);
		x[0] = 128;
		rep(i, m) cin >> c[i];
		rep(i, n) cin >> x[i + 1];
		// cout << "finish input" << endl;

		vec<vec<int>> dp(n + 1, vec<int>(256, - 1));
		dp[0][128] = 0;
		rep(i, n) {
			// cout << i << endl;
			rep(j, 256) {
				if (dp[i][j] < 0) continue;
				// cout << j << endl;
				rep(k, m) {
					int l = j + c[k];
					if (l < 0) l = 0;
					else if (l > 255) l = 255;
					int keep = dp[i][j] + (l - x[i + 1]) * (l - x[i + 1]);
					// cout << "keep = " << keep << endl;
					
					if (dp[i + 1][l] < 0 || dp[i + 1][l] > keep) dp[i + 1][l] = keep;
					// cout << "dp = " << dp[i + 1][l] << endl;
				}
			}
		}
		// cout << "out" << endl;

		int min = 1000000000;
		rep(i, 256) {
			if (dp[n][i] < 0) continue;
			if (min > dp[n][i]) min = dp[n][i];
		}

		cout << min << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int N,M;
int C[20];
int X[20004];
const long long INF = 1000000000000;
long long dp[20004][130];
long long dfs(int i_,int y_) {
    if(i_ == N) return 0;
    if(dp[i_][y_]!=-1) return dp[i_][y_];

    long long ret = INF;

    rep(i,M) {
        int y = y_ + C[i];
        y = max(y,0);
        y = min(y,255);
        //cout<<y<<","<<X[i_]<<endl;
        ret = min(ret,dfs(i_+1,y)+(X[i_]-y)*(X[i_]-y));

    }
    return dp[i_][y_]=ret;

}
void solve() {
    rep(i,20004) rep(j,130) dp[i][j] = -1;
    rep(i,M) cin>>C[i];
    rep(i,N) cin>>X[i];
    long long ans = INF;
    ans = min(ans,dfs(0,128));
    cout<<ans<<endl;

}
int main() {
    while(cin>>N>>M) {
        if(N+M==0) return 0;
        solve();
    }

    return 0;
}