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;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX/3
#define MAX_N 1000000001


int main(){
  cin.sync_with_stdio(false);
  int n, m;
  ll dp[20001][256];
  while(cin >> n >> m, n | m) {
    vector<int> c(m), x(n);
    rep(i, m) cin >> c[i];
    rep(i, n) cin >> x[i];

    rep(i, n + 1)rep(j, 256) dp[i][j] = INF;
    dp[0][128] = 0;
    rep(i, n) {
      rep(j, 256) {
        if (dp[i][j] < INF) {
          rep(k, m) {
            int tmp = j + c[k];
            if (tmp > 255) tmp = 255;
            else if (tmp < 0) tmp = 0;
            minch(dp[i + 1][tmp], dp[i][j] + (x[i] - tmp) * (x[i] - tmp));
          }
        }
      }
    }

    ll ans = INF;
    rep(i, 256) minch(ans, dp[n][i]);

    cout << ans << endl;
  }

  return 0;
}

C++: #include<string>
#include <vector>
#include <stack>
#include <map>
#include<iostream>
#include <algorithm>
#include <functional>

using namespace std;
int n;
int m;
int price;
int a;
int b;

struct G{
	string name;
	double value;
};
bool operator>(const G& left, const G& right)
{
	if(left.value>right.value){
		return true;
	}else if(left.value<right.value){
		return false; 
	}else{
		return left.name<right.name;
	}
}

bool operator<(const G& left, const G& right)
{
  	if(left.value>right.value){
		return false;
	}else if(left.value<right.value){
		return true; 
	}else{
		return left.name>right.name;
	}
}



int main(){
	while(true){
		cin >>n;
		cin >>m;

		if(n==0){
			break;
		}
		vector<int> codebook;
		vector<int> data;
		for(int i=0;i<m;i++){
			cin >> a;
			codebook.push_back(a);
		}
		for(int i=0;i<n;i++){
			cin >> a;
			data.push_back(a);
		}
		//値,誤差値でハッシュ。
		map<int,int> hash;
		hash[128]=0;

		for(int i=0;i<n;i++){
			int d=data[i];//次のデータ
			map<int,int>::iterator it = hash.begin();		
			map<int,int> next_hash;
			while( it != hash.end() )
			{
				for(int k=0;k<m;k++){
					int f=max(min((*it).first+codebook[k],255),0);
					int div=f-d;
					int s=(*it).second+div*div;
					if(next_hash.find(f)!= next_hash.end()){
						next_hash[f]=min(next_hash[f],s);
					}else{
						next_hash[f]=s;
					}
				}
				++it;
			}
			hash=next_hash;
		}
		int mi=INT_MAX;
		map<int,int>::iterator it = hash.begin();
		while( it != hash.end() )
		{
			mi=min((*it).second,mi);
			it++;
		}
		cout << mi <<endl;
	}
}

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

int main(){
  int n,m;
  int dp[256][256];
  while(cin>>n>>m,n){
    for(int i=0;i<256;i++)
      for(int j=0;j<256;j++)
	dp[i][j]=1<<30;
    dp[0][128]=0;
    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];
    
    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++){
	for(int k=0;k<m;k++){
	  if(j+c[k]<0){
	    dp[i+1][0]=min(dp[i+1][0],dp[i][j] + x[i]*x[i]);
	  }else if(j+c[k]>255){
	    dp[i+1][255]=min(dp[i+1][255],dp[i][j] + (x[i]-255)*(x[i]-255));
	  }else{
	    dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j] + (x[i]-j-c[k])*(x[i]-j-c[k]));
	  }
	}
      }
    }
    // for(int j=0;j<256;j++){
    //   for(int i=0;i<n;i++){
    // 	cout << dp[i][j] << " ";
    //   }
    //   cout << endl;
    // }

    int res=1<<30;
    for(int i=0;i<256;i++)res=min(res,dp[n][i]);
    cout << res << endl;
  }
  return 0;
}

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

int dp[20005][300];

int solve(int N, int M) {
    vector<int> C(M);
    for (int i = 0; i < M; i++) {
        cin >> C[i];
    }
    vector<int> X(N);
    for (int i = 0; i < N; i++) {
        cin >> X[i];
    }
    
    const int INF = 100000000;
    for (int i = 0; i < 20005; i++) {
        for (int j = 0; j < 300; j++) {
            dp[i][j] = INF;
        }
    }
    
    dp[0][128] = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 300; j++) {
            if (dp[i][j] == INF) continue;
            for (int k = 0; k < M; k++) {
                int nj = j + C[k];
                nj = min(255, nj);
                nj = max(0, nj);
                dp[i+1][nj] = min((X[i] - nj)*(X[i] - nj) + dp[i][j], dp[i+1][nj]);
            }
        }
    }
    
    int ret = INF;
    for (int i = 0; i < 256; i++) {
        ret = min(ret, dp[N][i]);
    }
    return ret;
}

int main(void){
    // Your code here!
    int N, M;
    vector<int> ans;
    while (1) {
        cin >> N >> M;
        if (!N && !M) break;
        ans.push_back(solve(N, M));
    }
    for (auto &i : ans) {
        cout << i << endl;
    }
}