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 <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
 
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define MCLR(a) memset((a), -1 ,sizeof(a))
#define SZ(a) (sizeof(a))
#define FILL(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v)

bool cheak(int x,int y,int xMax,int yMax)
{return x >= 0 && y >= 0 && xMax > x && yMax > y;}
const int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
const int INF = 2147483648/3;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

const int MAX = 20020;
ll dp[MAX][256];

int main()
{
	int n,m;
	while(cin >> n >> m && (n || m))
	{
		int c[20],x[MAX];
		REP(i,m)cin >> c[i];
		REP(i,n)cin >> x[i];
		
		MCLR(dp);
		dp[0][128] = 0;

		REP(i,n)
		REP(j,256)
		if(dp[i][j] != -1)
		REP(k,m)
		{
			int tmp = j+c[k];
			if(tmp < 0)
				tmp = 0;
			if(tmp >= 256)
				tmp = 255;
			
			ll val = pow(x[i]-tmp,2);
			if(dp[i+1][tmp] == -1 || val < dp[i+1][tmp])
				dp[i+1][tmp] = val+dp[i][j];
		}

		ll ans = INF;
		REP(j,256)
		if(dp[n][j] != -1)
		ans = min(dp[n][j],ans);
		
		cout << ans << endl;
	}

	return 0;

}

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

using namespace std;

const int INF = 1<<29;

int main(){
  int n, m;
  while(cin >> n >> m && (n|m)){
    vector<int> C(m);
    for(int i=0; i<m; i++) cin >> C[i];
    
    vector<int> dp(256, INF);
    dp[128] = 0;
    while(n--) {
      vector<int> next(256, INF);
      int in; cin >> in;
      for(int i=0; i<256; i++){
	if(dp[i] < INF) {
	  for(int j=0; j<m; j++){
	    int conv = i + C[j];
	    if(conv < 0)   { conv = 0;   }
	    if(conv > 255) { conv = 255; }
	    int diff = (in - conv) * (in - conv);
	    next[conv] = min(next[conv], dp[i] + diff );
	  }
	}
      }
      dp = next;
    }
    
    cout << *min_element(dp.begin(), dp.end()) << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>
#include<stack>

using namespace std;

#define INF 999999999
#define REP(i,n) for(int i=0; i<(int)(n); i++)

long long int dp[2][256];

int main(){
	int i, j, m, n, c[16], x;
	long long int ans;
	while(1){
		cin >> n >> m;
		if(!n) break;
		ans = INF;
		REP(a,2)REP(b,256) dp[a][b] = INF;
		dp[0][128]=0;
		REP(a,m) cin >> c[a];
		REP(a,n){
			cin >> x;
			REP(y,256){
				if(dp[0][y]!=INF){
					REP(z,m){
						if(y+c[z]<=0){
							if(dp[1][0]>=dp[0][y]+pow(x-0,2)){
								dp[1][0]=dp[0][y]+pow(x-0,2);
							}
						}
						else if(y+c[z]>=255){
							if(dp[1][255]>=dp[0][y]+pow(x-255,2)){
								dp[1][255]=dp[0][y]+pow(x-255,2);
							}
						}
						else{
							if(dp[1][y+c[z]]>=dp[0][y]+pow(x-y-c[z],2)){
								dp[1][y+c[z]]=dp[0][y]+pow(x-y-c[z],2);
							}
						}
					}
				}
			}
			REP(b,256){
				dp[0][b]=dp[1][b];
				dp[1][b]=INF;
			}
		}
		REP(a,256)if(dp[0][a]<ans) ans = dp[0][a];
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<math.h>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<map>
#define INF 999999999999
#define EPS 1.0e-6

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;

int n, m;
int c[20];
ll x[21000];
ll d[21000][260];

int main()
{
	while (cin >> n >> m) {
		if (n == 0 && m == 0)return 0;
		for (int i = 0; i < m; i++) {
			cin >> c[i];
		}

		for (int i = 1; i <= n; i++) {
			cin >> x[i];
		}
		for (int i = 0; i <= n; i++) {
			for (int j = 0; j <= 256; j++) {
				d[i][j] = INF;
			}
		}
		d[0][128] = 0;

		for (int i = 0; i < n ; i++) {
			for (int j = 0; j <= 255; j++) {
				if (d[i][j] != INF) {
					for (int k = 0; k < m; k++) {
						int l = j + c[k];
						//cout << l << endl;
						if (l < 0)d[i + 1][0] = min(d[i + 1][0], x[i + 1] * x[i + 1]);
						else if (l > 255) {
							d[i + 1][255] = min(d[i + 1][256], d[i][j]+(x[i + 1] - 255)*(x[i + 1] - 255));
							//cout << d[i + 1][256] << endl;
						}
						else{
							d[i+1][l]= min(d[i + 1][l], d[i][j] + (x[i + 1] - l)*(x[i + 1] - l));
							//cout << i + 1 << " " << j << " " << l << " " << d[i + 1][l];
						}
						//cout << i + 1 << " " << j << " " << l << " " << d[i + 1][l]<<endl;
						
					}
				}
			}
		/*
			for (int j = 0; j <= 256; j++) {
				cout << i<< "j:" <<j<<" "<<d[i][j] << endl;

			}
			cout << endl;
			*/
			
		}
		ll ans = INF;
		for (int i = 0; i <= 255; i++) {
			//cout <<"d[n-1][i]:"<< d[n][i] << endl;
			ans = min(ans, d[n][i]);
		}
		cout << ans << endl;
	}

	return 0;
}