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<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;


template<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}
template<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}
template<typename T,typename U>ostream & operator << (ostream &o,pair<T,U> &A){o<<A.F<<" "<<A.S; return o;}
template<typename T>ostream & operator << (ostream &o,vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?" ":"");} return o;}
template<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}



int main(){
    const ll MX=256;
    ll n,m;
    while(cin>>n>>m,n){
        vector<ll> C(m);
        cin>>C;
        vector<ll> X(n);
        cin>>X;
        vector<vector<ll>> dp(n+1,vector<ll>(MX,1e15));
        dp[0][MX/2]=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<MX;j++){
                for(int k=0;k<m;k++){
                    ll nx=j+C[k];
                    nx=max(min(nx,MX-1),0LL);
                    dp[i+1][nx]=min(dp[i+1][nx],dp[i][j]+(nx-X[i])*(nx-X[i]));
                }
            }
        }
        ll ans=E;
        for(auto &I:dp.back()){ans=min(ans,I);}
        cout<<ans<<endl;
    }
    
    
    return 0;
}

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

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

using namespace std;

const int INF = 0x3fffffff;

int C[20], dp[20005][300];
int main(){
	int N, M;
	while(cin >> N >> M, N|M){
		rep(i,M) cin >> C[i];
		fill( (int*)dp[0], (int*)dp[20005], INF );
		dp[0][128] = 0;
		rep(i,N){
			int x;
			cin >> x;
			rep(j,256) rep(k,M){
				int nx = j + C[k];
				nx = max( nx, 0 );
				nx = min( nx, 255 );
				int df = abs( nx - x );
				dp[i+1][nx] = min( dp[i+1][nx], dp[i][j] + (df * df) );
			}
		}
		int ans = INF;
		rep(i,256){
			ans = min( ans, dp[N][i] );
		}
		cout << ans << 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;
 #define ll long long
int ta[20],c[25000];
ll dp[20000][256];
const int INF=180000000000;
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";
	}*/
	ll ans=INF;
	for(int i=0;i<256;i++)ans=min(ans,dp[n][i]);
	cout<<ans<<endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
#define INF (1<<28)
int N,M;
int t[20000];
int u[20000];
int dp[20000][256];
 
void init(){
  for(int i=0;i<20000;i++)
    for(int j=0;j<256;j++)
      dp[i][j]=INF;
}
 
int calc(int a,int b){
  if(a+b<0)return 0;
  if(a+b>=256)return 255;
  return a+b;
}
 
int dist(int a,int b){
  return (a-b)*(a-b);
}
 
int main(){
  while(1){
    cin>>N>>M;
    if(N==0&&M==0)break;
    init();
    for(int i=0;i<M;i++)cin>>t[i];
    for(int i=0;i<N;i++)cin>>u[i];
    for(int i=0;i<M;i++)dp[0][calc(128,t[i])]=dist(calc(128,t[i]),u[0]);
 
    for(int i=0;i+1<N;i++){
      for(int j=0;j<256;j++){
    if(dp[i][j]==INF)continue;
    //cout<<i<<' '<<j<<' '<<dp[i][j]<<endl;
    for(int k=0;k<M;k++){
      int A=calc(j,t[k]);
      //cout<<A<<endl;
      dp[i+1][A]=min(dp[i+1][A],dp[i][j]+dist(A,u[i+1]));
       
    }
      }
    }
    int ans=INF;
    for(int i=0;i<256;i++)
      ans=min(ans,dp[N-1][i]);
    cout<<ans<<endl;
  }
  return 0;
}