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>

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

inline int in() { int x; std::scanf("%d", &x); return x; }
inline void pr(int x, char c=10){ std::printf("%d%c", x, c); }

using ll = long long;

using namespace std;

int C[20];
int X[20200];
ll dp[20200][256];
int N, M;

ll inf = 1e18;

signed main() {
    while (N = in(), M = in()) {
        rep(i, M) C[i] = in();
        rep(i, N) X[i] = in();
        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) continue;
            rep(k, M) {
                const int nxt = max(min(255, j + C[k]), 0);
                ll& d = dp[i + 1][nxt];
                int c = (X[i] - nxt);
                if (dp[i][j] + c * c < d) {
                    d = dp[i][j] + c * c;
                }
            }
        }
        pr(*min_element(dp[N], dp[N] + 256));
    }

    return 0;
}

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

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int dp[n+1][256];
    for(int i=0;i<=n;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 <iostream>
#include <vector>
#include <algorithm>
#define INF (1<<21)
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);
    }
    sort(C.begin(),C.end());

    int y[256][2];
    for(i=0;i<256;i++) y[i][0] = y[i][1] = INF;
    y[128][0] = 0;
    for(i=0;i<n;i++){
      for(j=0;j<m;j++){
	for(k=0;k<256;k++){
	  if(y[k][0] != INF){
	    int a = k + C[j];
	    if(a < 0) a = 0;
	    else if(a > 255) a = 255;
	    y[a][1] = min(y[a][1],y[k][0]+(x[i]-a)*(x[i]-a));
	  }
	}
      }
      for(j=0;j<256;j++){
	y[j][0] = y[j][1];
	y[j][1] = INF;
      }
    }

    int ans = INF;
    for(i=0;i<256;i++) ans = min(ans,y[i][0]);

    cout << ans << endl;
  }
  return 0;
}

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 1000000007
#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[160], x[200000];
int dp[20011][256];

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 160){
			REP(j, 2560){
				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;
					}
					else 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, 2560){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

C++: #include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int INF=2e9;

int N,M;
int C[20];
int x[20010];
int dp[20010][260]={};
int main(){
    while(cin>>N>>M,N!=0){
        for(int i=1;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<=255;j++){
                dp[i][j]=INF;
            }
        }
        dp[0][128]=0;
        for(int i=0;i<N;i++){
            for(int j=0;j<=255;j++){
                //if(dp[i][j]!=INF){
                    for(int k=1;k<=M;k++){
                        int sig=j+C[k];
                        if(sig<0){
                            sig=0;
                        }else if(sig>255){
                            sig=255;
                        }
                        dp[i+1][sig]=min(dp[i+1][sig],dp[i][j]+(x[i+1]-sig)*(x[i+1]-sig));
                    }
                //}
            }
        }
        int ans=INF;
        for(int i=0;i<=255;i++){
            ans=min(ans,dp[N][i]);
        }
        cout<<ans<<endl;
    }
    return 0;
}