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 <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 10000007
#define EPS 1e-10

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[16 + 1], x[20000 + 1];
int dp[1][256 + 1];

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

C++: #include <iostream>
#define REP(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,a) REP(i,0,a)
using namespace std;
const int R = 20010;
int N,M,C[16],x[R],dp[R][256], inf = 1 << 28;

int main(void){
    while (1) {
        cin >> N >> M;
        if (N == 0) break;
        rep(i,R) rep(j,256) 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) rep(k,M) {
                    int nxt = max(0, min(255,j+C[k]));
                    int cost = (x[i]-nxt)*(x[i]-nxt);
                    dp[i+1][nxt] = min(dp[i+1][nxt], dp[i][j]+cost);
        }
        
        int ans = inf;
        rep(i,256) ans = min(ans, dp[N][i]);
        cout << ans << endl;
    }
    return 0;    
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <map>
#include <climits>
using namespace std;
#define mod (1000000007)
#define ll long long int

int main(void){
  while(true){
    int N,M;
    cin >> N >> M;
    if(N==0){
      break;
    }

    vector<int> cc,xx;
    ll tmp;
    for (size_t i = 0; i < M; i++) {
      cin >> tmp;
      cc.push_back(tmp);
    }
    for (size_t i = 0; i < N; i++) {
      cin >> tmp;
      xx.push_back(tmp);
    }

    vector<vector<ll>> dp;
    dp.assign(N+1, vector<ll>(256, LLONG_MAX/100));
    dp[0][128] = 0;

    for (int i = 0; i < N; i++){
      for (int k = 0; k <= 255 ; k++){
        for (int c: cc){
          if(k+c>=255){
            tmp = 255;
          }else if(k+c <=0){
            tmp = 0;
          }else{
            tmp = k+c;
          }
          //cout << dp[i][k] << ',' << k+c << endl;
          dp[i+1][tmp] = min(dp[i+1][tmp],dp[i][k] + (tmp-xx[i])*(tmp-xx[i]));
        }
        //cout << dp[i][k] << endl;
      }
    }

    ll ans = LLONG_MAX;
    for(auto t: dp[N]){
      ans = min(ans,t);
    }

    cout << ans << endl;
  }
}

C++: #include <iostream>

using namespace std;

long long int ans;

int min(int a,int b){
	if(a>=b)return b;
	else return a;
}

int main(){

	int n,m;
	long long int dp[20][256];
	int next;

	while(cin>>n>>m){
		ans = 1000000000000;
		if(n==0 && m==0){
			break;
		}
		int *c;
		int *x;
		c = new int[m];
		x = new int[n];

		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<n;i++){
			for(int j=0;j<256;j++){
				dp[i][j]=10000000000;
			}
		}

		for(int i=0;i<m;i++){
			next = 128+c[i];
			if(next>=255)next=255;
			if(next<=0)next = 0;
			dp[0][next] = (x[0]-next)*(x[0]-next);
		}
		/*
		for(int i=0;i<256;i++){
			cout<<dp[0][i]<<" ";
		}
		cout<<endl;
		*/
		for(int i=1;i<n;i++){
			for(int j=0;j<256;j++){
				for(int k=0;k<m;k++){
					next = j+c[k];
					if(next>=255)next=255;
					if(next<=0)next = 0;
					//dp[next] = min(dp[next],dp[j]+(x[i]-next)*(x[i]-next));
					dp[i][next] = min(dp[i][next],dp[i-1][j]+(x[i]-next)*(x[i]-next));
				}
			}
		}
		for(int i=0;i<256;i++){
			ans = min(ans,dp[n-1][i]);
		}


		cout<<ans<<endl;

	}

	return 0;

}