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>
#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(!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<stdio.h>
#include<string.h>
#include<math.h>
#define min(a,b) (a>b?b:a)
int N,M,C[20],x[20005],f,s;
long long res,dp[2][300];
int main()
{
	for(;scanf("%d%d",&N,&M),N+M;)
	{
		res=100000000000;
		memset(dp,0x7f,sizeof(dp));
		for(int i=0;i<M;i++)scanf("%d",&C[i]);
		for(int j=1;j<=N;j++)scanf("%d",&x[j]);
		f=0,s=1;
		dp[f][128]=0;
		for(int i=1;i<=N;i++)
		{
			memset(dp[s],0x7f,sizeof(long long[300]));
			for(int j=0;j<=255;j++)
				for(int k=0;k<M;k++)
				{
					int np=j+C[k],t;
					
					if(np>255)np=255;
					if(np<0)np=0;
					t=(x[i]-np);t*=t;
					dp[s][np]=min(dp[s][np],dp[f][j]+t);
				}
			f=!f;s=!f;
		}
		for(int i=0;i<=255;i++)res=min(res,dp[f][i]);
		printf("%lld\n",res);
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}

int dp[20002][256];

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

	vector<int> C, x;
	inputVector(C, M);
	inputVector(x, N);

	rep(i, N + 1) rep(j, 256) dp[i][j] = INT_MAX;
	dp[0][128] = 0;
	rep(i, N) {
	    rep(j, 256) {
		if (dp[i][j] >= INT_MAX) continue;
		rep(k, M) {
		    int val = j + C[k];
		    if (val > 255) val = 255;
		    else if (val < 0) val = 0;
		    int dif = (x[i] - val) * (x[i] - val);
		    dp[i + 1][val] = min(dp[i + 1][val], dp[i][j] + dif);
		}
	    }
	}
	int ret = INT_MAX;
	rep(i, 256) {
	    ret = min(ret, dp[N][i]);
	}
	cout << ret << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1 << 22;
void db_print(int line[]){
  for(int i = 100; i < 200; ++i){
    cout << i << "[" << line[i] << "]" << endl;
  }
  cout << endl;
}
int main(){
  int N, M;
  while(true){
    cin >> N >> M;
    if((N|M) == 0){
      break;
    }
    int book[M];
    for(int i = 0; i < M; ++i){
      cin >> book[i];
    }
    int x[N];
    for(int i = 0; i < N; ++i){
      cin >> x[i];
    }
    int table[N+1][256];
    fill_n((int *) table, (N+1) * 256, INF);
    table[0][128] = 0;
    for(int i = 0; i < N; ++i){
      //db_print(table[i]);
      for(int j = 0; j < 256; ++j){
	for(int b = 0; b < M; ++b){	  
	  int d = book[b];
	  if(0 <= j+d && j+d <= 255){
	    int t = (x[i] - (j+d)) * (x[i] - (j+d));
	    table[i+1][j+d] = min(table[i+1][j+d], table[i][j]+t);
	  }
	  if(j+d < 0){
	    int t = (x[i] - 0) * (x[i] - 0);
	    table[i+1][0] = min(table[i+1][0], table[i][j]+t);
	  }
	  if(j+d > 255){
	    int t = (x[i] - 255) * (x[i] - 255);
	    table[i+1][255] = min(table[i+1][255], table[i][j]+t);
	  }
	}
      }
    }
    //db_print(table[N]);
    int ans = INF;
    for(int i = 0; i < 256; ++i){
      ans = min(ans, table[N][i]);
    }
    cout << ans << endl;
  }    
  return 0;
}