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 ll=long long;

#define itn long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rrep(i,n) for(int i=(int)(n);i>=0;--i)
#define debug(x) cout << #x << "=" << (x) << endl;
const ll MOD=1e9+7;

template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> void fail(T v){cout << v << endl;exit(0);}
//template end

void solve(){
  while(1){
    int N,M;
    cin>>N>>M;
    if(!(N|M))return;
    vector<int> dp(256,1<<29);
    dp[128]=0;
    vector<int> C(M);
    rep(i,M) cin >> C[i];
    
    rep(i,N){
      int x;
      cin>>x;
      vector<int> newdp(256,1<<29);
      rep(j,256){
        if(dp[j]==(1<<29))continue;
        for(int k=0;k<M;k++){
          int a=min(255,j+C[k]);chmax(a,0);
          chmin(newdp[a],dp[j]+(a-x)*(a-x));
        }
      }
      dp=newdp;
    }
    int res=1<<29;
    rep(i,256)
      chmin(res,dp[i]);
    cout<<res<<endl;
  }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  solve();
  return 0;
}

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

using namespace std;

#define MAX_M 16
#define MAX_N 20000
#define INF 1e8

int N, M, C[MAX_M], x[MAX_N];
int dp[MAX_N][256];

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];
    }
    int ans = INF;
    fill(dp[0], dp[MAX_N], INF);
    dp[0][128] = 0;
    for(int i = 0 ; i < N ; i++){
      for(int j = 0 ; j <= 255 ; j++){
        for(int k = 0 ; k < M ; k++){
          int t = j + C[k];
          if(t < 0) t = 0;
          if(t > 255) t = 255;
          dp[i+1][t] = min(dp[i+1][t], dp[i][j] + (t-x[i])*(t-x[i]));
        }
      }
    }
    for(int i = 0 ; i <= 255 ; i++){
      ans = min(ans, dp[N][i]);
    } 
    cout << ans << endl;
  }

  return 0;
}

C++: //Yattazo! Watashiha-Yosen-tsuukashita! It's 460points/600points! OHO!!!!!
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int x[65600][260],n,m,y[65600],z[65600],d,minx;
int main(){
	while(true){
		minx=2000000000;
		for(int i=0;i<65536;i++){for(int j=0;j<256;j++){x[i][j]=2000000000;}}
		cin>>n>>m;if(!n){break;}
		for(int i=0;i<m;i++){cin>>y[i];}
		for(int i=1;i<=n;i++){cin>>z[i];}
		x[0][128]=0;
		for(int i=1;i<=n;i++){
			for(int j=0;j<256;j++){
				if(x[i-1][j]<1000000000){
					for(int k=0;k<m;k++){
						d=y[k]+j;
						if(d<0){d=0;}
						if(d>255){d=255;}
						x[i][d]=min(x[i][d],x[i-1][j]+(int)pow(1.0*(z[i]-d),2));
					}
				}
			}
		}
		for(int i=0;i<256;i++){minx=min(minx,x[n][i]);}
		cout<<minx<<endl;
	}
}

C++: #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define all(c) begin(c),end(c)
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
int dd[] = { 0, 1, 0, -1, 0 }; //→↓←↑

void solve()
{
	int N, M;
	vector<int> C;
	vector<vector<ll>> dp;
	while (true)
	{
		cin >> N >> M;
		if (N == 0 && M == 0)break;
		C = vector<int>(M);
		for (int i = 0; i < M; i++)
		{
			cin >> C[i];
		}
		dp = vector<vector<ll>>(N + 1, vector<ll>(256, LLONG_MAX / 3));
		dp[0][128] = 0;
		int x;
		for (int i = 0; i < N; i++)
		{
			cin >> x;
			for (int j = 0; j < 256; j++)
			{
				for (int k = 0; k < M; k++)
				{
					int l = min(max(j + C[k], 0), 255);
					chmin(dp[i + 1][l], dp[i][j] + (x - l) * (x - l));
				}
			}
		}
		ll ans = LLONG_MAX;
		for (int i = 0; i < 256; i++)
		{
			chmin(ans, dp[N][i]);
		}
		cout << ans << endl;
	}
}

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