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;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define INF 1e9
#define EPS 1e-9

int main(){
	int n,m;
	while(cin>>n>>m,n){
        vi code(m);
        rep(i,m)cin>>code[i];
        vector<vector<pii>> dp(n+1,vector<pii>(m,mp(INF,0)));
        fill(all(dp[0]),mp(0,128));
        range(i,1,n+1){
            int num; cin>>num;
            rep(j,m){//j??????
                rep(k,m){  //min??¨
                    int next=min(max(dp[i-1][k].second+code[j],0),255);
                    int diff=num-next; diff*=diff;
                    if(dp[i][j].first>dp[i-1][k].first+diff){
                        dp[i][j]=mp(dp[i-1][k].first+diff,next);
                    }
                }
            }
        }
        int ans=INF;
        rep(i,m) ans=min(ans,dp[n][i].first);
        cout<<ans<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
struct Edge{int from, to; ll cost;};

const ll MOD = 1000000007;
const long double EPS = 10e-10;


int main(){
    int n,m;
    while(scanf("%d%d", &n, &m) && n){
        ll x[n+1], c[m], dp[n+2][256];
        rep(m) scanf("%lld", &c[i]);
        x[0] = 128;
        rep(n) scanf("%lld", &x[i+1]);

        fill(dp[0], dp[n+2], LLONG_MAX);
        dp[0][128] = 0LL;
        rep(n){
            repp(j, 256){
                if(dp[i][j] == LLONG_MAX) continue;
                repp(k, m){
                    ll jj = max(0LL, min(255LL, j+c[k]));
                    ll diff = jj - x[i+1];
                    dp[i+1][jj] = min(dp[i+1][jj], dp[i][j] + diff*diff);
                }
            }
        }

        ll ans = LLONG_MAX;
        repp(j, 256) ans = min(ans, dp[n][j]);
        printf("%lld\n", ans);
    }
}

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

using namespace std;

typedef long long lli;

const lli INF = (1<<30)-1;

lli n, m, data[16], dp[2][256], in;

main(){
  while(cin >> n >> m && (n|m)){
    for(int i=0;i<m;i++) cin >> data[i];
    fill(dp[0], dp[2], INF);
    dp[0][128] = 0;
    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++) dp[(i+1)%2][j] = INF;
      cin >> in;
      for(int j=0;j<256;j++){
        if(dp[i][j] == INF) continue;
        for(int k=0;k<m;k++){
          lli next = j + data[k];
          if(next < 0) next = 0;
          if(next > 255) next = 255;
          dp[(i+1)%2][next] = min(dp[(i+1)%2][next], abs(in-(next)) * abs(in-(next)) + dp[i%2][j]);
        }
      }
    }
    lli ans = INF;
    for(int i=0;i<256;i++) ans = min(ans, dp[n%2][i]);
    cout << ans << endl;
  }
}

C++: #include <iostream>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

void chmin(int &a, int b) { a = min(a, b); }

int INF = 1e+15;
int n, m;
int c[16];
int x[20000];
int dp[20001][256];

signed main() {
	int i, j, k;
	
	while (cin >> n >> m) {
		if (!n) break;
		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) {
				rep(k, m) {
					int y = j + c[k];
					if (y < 0) y = 0;
					if (y > 255) y = 255;
					chmin(dp[i + 1][y], dp[i][j] + (x[i] - y) * (x[i] - y));
				}
			}
		}
		
		int ans = INF;
		rep(i, 256) chmin(ans, dp[n][i]);
		cout << ans << endl;
	}
	return 0;
}

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

int dp[20001][256];

int main(){

  int n,m,c[16],x[20000];

  while(cin>>n>>m,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<20001;i++)
      for(int j=0;j<256;j++)dp[i][j]=1e9;

    dp[0][128]=0;

    for(int i=0;i<n;i++)
      for(int j=0;j<256;j++)
	for(int k=0;k<m;k++){
	  int y=min(255,max(0,j+c[k]));
	  dp[i+1][y]=min(dp[i][j]+(y-x[i])*(y-x[i]),dp[i+1][y]);
	}
  
    int ans=1e9;
    for(int i=0;i<256;i++)ans=min(ans,dp[n][i]);

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