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 <algorithm>
#include <vector>
using namespace std;

int main(){
    int N,M;
    while(cin>>N>>M,N){
        vector<int> C(M);
        for(int i=0;i<M;i++){
            cin>>C[i];
        }
        int error[2][256];
        fill(error[0],error[2],1000000000);
        error[0][128]=0;
        for(int i=1;i<=N;i++){
            int x;
            cin>>x;
            for(int j=0;j<256;j++) error[i&1][j]=1000000000;
            for(int j=0;j<256;j++){
                if(error[i&1^1][j]!=1000000000){
                    for(int k=0;k<M;k++){
                        int jk=j+C[k];
                        jk=max(jk,0);
                        jk=min(jk,255);
                        error[i&1][jk]=min(error[i&1][jk],error[i&1^1][j]+(x-jk)*(x-jk));
                    }
                }
            }
        }
        int ans = 1000000000;
        for(int j=0;j<256;j++){
            ans=min(ans,error[N&1][j]);
        }
        cout<<ans<<endl;
    }

    return 0;
}

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  while(true){
      int n,m;cin>>n>>m;
      if(n==0 && m==0) break;
      VVI dp(n+1,vector<ll>(256,INF));
      std::vector<int> c(m),x(n+1);
      for(int i=0;i<m;i++) cin>>c[i];
      for(int i=1;i<=n;i++) cin>>x[i];
      //ll dp[n+1][256];
      for(int i=0;i<n+1;i++)for(int j=0;j<256;j++)dp[i][j]=INF;
      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++){
              if(j+c[k]>255) dp[i+1][255]=min(dp[i+1][255],dp[i][j]+(255-x[i+1])*(255-x[i+1]));
              else if(j+c[k]<0) dp[i+1][0]=min(dp[i+1][0],dp[i][j]+(x[i+1])*(x[i+1]));
              else dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j]+(j+c[k]-x[i+1])*(j+c[k]-x[i+1]));
          }
      }
      ll res=INF;
      for(int i=0;i<256;i++) res=min(res,dp[n][i]);
      cout<<res<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<set>
using namespace std;
int ta[20],c[25000];
int dp[20000][256];
const int INF=1800000000;
int main(){
	int n,m;
	while(cin>>n>>m,n+m){
	for(int i=0;i<m;i++)cin>>ta[i];
	for(int j=0;j<n;j++)cin>>c[j];
	
	for(int i=0;i<20000;i++)fill(dp[i],dp[i]+256,INF);
	dp[0][128]=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<256;j++){
			if(dp[i][j]!=INF){
				int tmp=j;
				for(int k=0;k<m;k++){
					if(j+ta[k]<0)tmp=0;
					else if(j+ta[k]>255)tmp=255;
					else tmp=j+ta[k];
					dp[i+1][tmp]=min( dp[i+1][tmp] ,dp[i][j]+ (c[i]-tmp)*(c[i]-tmp) );
				}
			}//endif
		}
	}
	/*for(int i=0;i<=n;i++){
		for(int j=120;j<=140;j++){
		cout<<dp[i][j]<<" ";
		}
		cout<<"\n";
	}*/
	int ans=INF;
	for(int i=0;i<256;i++)ans=min(ans,dp[n][i]);
	cout<<ans<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;

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

const int MAXN = 20000, MAXM = 16, MAXS = 255;
int dp[MAXS + 10][MAXN + 10];
int c[MAXM + 1], x[MAXN + 10];
int main()
{

    int n, m;
    while(cin >> n >> m && n)
    {
        memset(dp, -1, sizeof(dp));
        REP(m) cin >> c[i];
        REP(n) cin >> x[i];

        dp[128][0] = 0;

        for(int i =0; i < n; i++)
        {
            for(int s = 0; s <= 255; s++)if(dp[s][i] != -1)
            {
                for(int j = 0; j < m; j++)
                {
                    int nexty = s + c[j];
                    if(nexty < 0) nexty = 0;
                    if(nexty > MAXS) nexty = MAXS;
                    
                    if(dp[nexty][i + 1] ==-1)
                        dp[nexty][i + 1] = dp[s][i] + (nexty - x[i]) * (nexty - x[i]);
                    else
                        dp[nexty][i + 1] = min(dp[nexty][i + 1],
                                dp[s][i] + (nexty - x[i]) * (nexty - x[i]) );
                }
            }
        }
        //rep(i, 255) cout << dp[i][n] << endl;

        int ans = (1 << 30);
        REP(MAXS + 1)if(dp[i][n] != -1) ans = min(ans, dp[i][n]);
        cout << ans << endl;

    }
    return 0;
}