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>

#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()

using namespace std;

using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;

const ll LINF=(1LL<<60);
const int INF=1<<29;
const int MOD=1e9+7;

template <typename T>
bool chmin(T &a, const T &b){
    if(a > b){
        a=b;
        return true;
    }
    return false;
}

vector<vector<ll>> dp;

int main(){
    int N, M; 
    while(cin >> N >> M){
        if(N == 0 && M == 0) break;
        vi C(M);
        for(auto &y : C) cin >> y;
        vi x(N);
        for(auto &y : x) cin >> y;
        dp.assign(N+1, vector<ll>(256, LINF));
        dp[0][128]=0;
        for(int i=0; i<N; i++){
            for(int j=0; j<M; j++){
                for(int k=0; k<256; k++){
                    int val=max(0, k+C[j]);
                    val=min(255, val);
                    chmin(dp[i+1][val], dp[i][k]+(x[i]-val)*(x[i]-val));
                }
            }
        }
        ll res=LINF;
        for(int i=0; i<256; i++) chmin(res, dp[N][i]);
        printf("%lld\n", res);
    }
    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
  
using namespace std;

#define pi 3.141592653589793

int result[20001][256];

int main()
{
	int n, m;
	while(1){
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		for(int i = 0; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				result[i][j] = 10000000;
			}
		}
		result[0][128] = 0;
		int c[17], x[20001];
		for(int i = 1; i < m + 1; i++){
			cin >> c[i];
		}
		for(int i = 1; i < n + 1; i++){
			cin >> x[i];
		}
		for(int i = 1; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				for(int k = 1; k < m + 1; k++){
					int nexty = j + c[k];
					if(nexty < 0) nexty = 0;
					else if(nexty > 255) nexty = 255;
					result[i][nexty] = min(result[i][nexty], result[i - 1][j] + (x[i] - nexty) * (x[i] - nexty));
				}
			}
		}
		int ans = 1000000;
		for(int i = 1; i < 256; i++) ans = min(ans, result[n][i]);
		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

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

using namespace std;

int main() {
  while(1){
    int n,m;
    cin>>n>>m;
    if(!n)break;
    vector<int> codes(m);
    REP(i,m)cin>>codes[i];
    vector<int> data(n);
    REP(i,n)cin>>data[i];
    vector<int64_t> dp(256,INT64_C(1000000000000000));
    dp[128] = 0;
    REP(i,n){
      vector<int64_t> tmp(256,INT64_C(1000000000000000));
      REP(j,256){
        REP(k,m){
          int newv = min(255, max(0, j+codes[k]));
          int diff = data[i] - newv;
          int sqd = diff*diff;
          tmp[newv] = min(tmp[newv], dp[j] + sqd);
        }
      }
      dp.swap(tmp);
    }
    cout << *min_element(begin(dp),end(dp)) << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
const ll MOD = 1e9+7;
const ll INF = 1e18;
ll dp[20010][300];

int main(){
  ll n,m;
  while(cin>>n>>m,n){
	ll c[22],x[20010];
	for(int i=0;i<m;i++)cin>>c[i];
	for(int i=0;i<n;i++)cin>>x[i];
  
	fill_n(*dp,20010*300,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 nj=j+c[k];
		  nj=min(nj,255);
		  nj=max(nj,0);
		  dp[i+1][nj]=min(dp[i+1][nj],dp[i][j]+(nj-x[i])*(nj-x[i]));
		}
	  }
	}

	ll 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;
#define INF 1000000000

int main()
{
    while (true)
    {
        int n,m;cin >> n >> m;
        if (n==0 && m==0) break;
        vector<int> code(m);
        for (int i=0;i<m;i++) cin >> code[i];
        vector<int> sound(n);
        for (int i=0;i<n;i++) cin >> sound[i];
        vector<vector<int>> dp(n+1,vector<int> (256,INF));
        dp[0][128]=0;
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<256;j++)
            {
                for (int k :code)
                {
                    if (j+k<256 && j+k>=0) dp[i+1][j+k]=min(dp[i+1][j+k],dp[i][j]+(sound[i]-j-k)*(sound[i]-j-k));
                    else
                    {
                        if (j+k>=0) dp[i+1][255]=min(dp[i+1][255],dp[i][j]+(sound[i]-255)*(sound[i]-255));
                        else dp[i+1][0]=min(dp[i+1][0],dp[i][j]+(sound[i])*(sound[i]));
                    }
                    
                }
            }
        }
        int ans=INF;
        for (int i=0;i<256;i++)
        {
            ans=min(ans,dp[n][i]);
        }
        cout << ans << endl;
    }
    return 0;
}