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++: /* monkukui 競技プログラミング用のテンプレート  (ここから) */
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
using ll = long long int;
using lnt = long long int;
using Graph = vector<vector<int>>;
using Wgraph = vector<vector<pair<int, long long int>>>;
constexpr long long int INF = 1001001001001001LL;
constexpr long long int MOD = 1000000007LL;
constexpr double PI = 3.1415926535897932;
constexpr long long int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
constexpr long long int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
inline void yes(){ cout << "yes" << endl; }
inline void Yes(){ cout << "Yes" << endl; }
inline void YES(){ cout << "YES" << endl; }
inline void no(){ cout << "no" << endl; }
inline void No(){ cout << "No" << endl; }
inline void NO(){ cout << "NO" << endl; }
inline void possible(){ cout << "possible" << endl; }
inline void Possible(){ cout << "Possible" << endl; }
inline void POSSIBLE(){ cout << "POSSIBLE" << endl; }
inline void impossible(){ cout << "impossible" << endl; }
inline void Impossible(){ cout << "Impossible" << endl; }
inline void IMPOSSIBLE(){ cout << "IMPOSSIBLE" << endl; }

#define REP(i,n) for(int i = 0; i < (n); i++)
#define RREP(i,n) for(int i = 1; i <= (n); i++)
#define DREP(i,n) for(int i = (n)-1; i >= 0; i--)
#define SREP(i,s,t) for(int i = s; i < t; i++)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define PB push_back

/* monkukui 競技プログラミング用のテンプレート (ここまで)*/

int main(){
  
  while(1) {
    int n, m; cin >> n >> m;
    if(n == 0) break;
    vector<lnt> c(m);
    for(int i = 0; i < m; i++) cin >> c[i];
    vector<lnt> x(n);
    for(int i = 0; i < n; i++) cin >> x[i];

    // DP 
    vector<vector<lnt>> dp(n + 1, vector<lnt> (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) continue;

        lnt val = j;
        for(int k = 0; k < m; k++) {
          int nxtVal = val + c[k];
          if(nxtVal < 0) nxtVal = 0;
          if(nxtVal > 255) nxtVal = 255;
          dp[i + 1][nxtVal] = min(dp[i + 1][nxtVal], dp[i][val] + (nxtVal - x[i]) * (nxtVal - x[i]));
        }
      }
    }
    
    lnt ans = INF;
    for(int j = 0; j < 256; j++) ans = min(ans, dp[n][j]);
    cout << ans << endl;

    
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
const lli inf = 1e18;

int lplus(int n, int m){
    if(n+m < 0) return 0;
    if(n+m > 255) return 255;
    return n+m;
}

int main(){
    while(1){
        int n,m;
        cin >> n >> m;
        if(n==0) break;

        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];
        vector<vector<lli> > dp(n+1, vector<lli>(256, 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++){
                    lli diff = x[i+1] -lplus(j,c[k]);
                    if(dp[i][j] +diff*diff < dp[i+1][lplus(j,c[k])]){
                        dp[i+1][lplus(j,c[k])] = dp[i][j]+diff*diff;
                    }
                }
            }
        }

        lli ans=inf;
        for(int i=0; i<256; i++) ans=min(ans, dp[n][i]);
        cout << ans << endl;
    }
    return 0;
}

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

int N,M;
int C[20];
int X[20001];

int dp[20001][257];

#define INF (1<<30)

int main(){
  while(  cin >> N >> M && (N||M) ){
    for(int i=0;i<M;i++) cin >> C[i];
    for(int i=0;i<N;i++) cin >> X[i];
    
    fill(dp[0],dp[20001],INF);
    dp[0][128] = 0;
    for(int i=0;i<N;i++){
      for(int j=0;j<256;j++){
	if( dp[i][j] == INF ) continue;
	for(int k=0;k<M;k++){
	  int nd = max ( 0 , min( 255, j + C[k]) );
	  dp[i+1][nd] = min( dp[i+1][nd],
			     dp[i][j] + (nd-X[i])*(nd-X[i]) );
	}
      }
    }
    int res = INF;
    for(int i=0;i<256;i++) res = min( res ,dp[N][i] );
    cout << res << endl;
  }
}