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;
const int INF = 1 << 30;

int main(){
  int N, M, C[16], x[20000];
  int dp[2][256];
  
  while(scanf("%d %d", &N, &M), N){
    for(int i = 0; i < M; i++){
      scanf("%d", &C[i]);
    }
    for(int i = 0; i < N; i++){
      scanf("%d", &x[i]);
    }
    fill_n( dp[1], 256, INF);
    dp[0][128] = 0;
    for(int i = 0; i < N; i++){
      for(int j = 0; j < 256; j++){
        if(dp[i & 1][j] == INF) continue;
        for(int k = 0; k < M; k++){
          int value = min( 255, max( 0, j + C[k]));
          dp[(i + 1) & 1][value] = min( dp[(i + 1) & 1][value], dp[i & 1][j] + (x[i] - value) * (x[i] - value));
        }
      }
      for(int j = 0; j < 256; j++) dp[i & 1][j] = INF;
    }
    int ret = INF;
    for(int i = 0; i < 256; i++){
      ret = min( ret, dp[N & 1][i]);
    }
    printf("%d\n", ret);
  }
}

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

using namespace std;

using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG

/**
 * For DEBUG
 * https://github.com/ta7uw/cpp-pyprint
 */
#include "cpp-pyprint/pyprint.h"

#endif

void solve() {
    while (true) {
        ll N, M;
        cin >> N >> M;
        if (N == 0 && M == 0)
            return;
        vector<ll> C(M), X(N);
        rep(i, M) cin >> C[i];
        rep(i, N) cin >> X[i];
        vector<vector<ll>> dp(N + 1, vector<ll>(256, INF));
        dp[0][128] = 0;
        rep(i, N) {
            ll x = X[i];
            rep(j, 256) {
                rep(m, M) {
                    ll c = C[m];
                    ll next = max(0LL, min(255LL, j + c));
                    ll y = abs(x - next);
                    dp[i + 1][next] = min(dp[i + 1][next], dp[i][j] + y * y);
                }
            }
        }
        ll ans = INF;
        rep(i, 256) {
            ans = min(ans, dp[N][i]);
        }
        cout << ans << '\n';
    }
}

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

C++: #include <iostream>
#include <vector>
#include <limits>
using namespace std;

inline int f(int n)
{
  return max(0, min(255, n));
}

int main()
{
  int N, M;
  while (cin >> N >> M && N != 0) {
    vector<int> cs(M);
    for (int i = 0; i < M; i++) {
      cin >> cs[i];
    }
    vector<int> xs(N);
    for (int i = 0; i < N; i++) {
      cin >> xs[i];
    }

    vector<vector<int> > dp(N+1, vector<int>(256, 100000000));
    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++) {
          const int y = f(j+cs[k]);
          dp[i+1][y] = min(dp[i+1][y], dp[i][j] + (xs[i]-y)*(xs[i]-y));
        }
      }
    }
    int ans = numeric_limits<int>::max();
    for (int i = 0; i <= 255; i++) {
      ans = min(ans, dp[N][i]);
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()

int dp[20010][256];

int main() {
    while(1){
        int n,m;
        cin>>n>>m;
        if(n==0 && m==0) break;
        int c[m],x[n];
        rep(i,m) cin>>c[i];
        rep(i,n) cin>>x[i];

        rep(i,20010) rep(j,256) dp[i][j]=INF;
        dp[0][128]=0;

        rep(i,n){
            rep(j,256){
                if(dp[i][j]==INF) continue;
                rep(k,m){
                    int y=j+c[k];
                    if(y<0) y=0;
                    if(y>255) y=255;
                    int sum2=(x[i]-y)*(x[i]-y);
                    dp[i+1][y]=min(dp[i+1][y],dp[i][j]+sum2);
                }
            }
        }
        int ans=INF;
        rep(j,256){
            //cout<<dp[n][j]<<endl;
            ans=min(ans,dp[n][j]);
        }

        cout<<ans<<endl;
    }

    return 0;

}

C++: #include <iostream>
#define INF 1e+18
#define int long long
using namespace std;

int dp[20001][256];

signed main(){
	int n,m,c[16];
	while(cin >> n >> m,n){
		for(int i = 0;i <= n;i++){
			for(int j = 0;j < 256;j++) {
				if(i) dp[i][j] = INF;
				else dp[i][j] = 0;
			}
		}
		for(int i = 0;i < m;i++) cin >> c[i];
		for(int i = 0;i < n;i++){
			int x;
			cin >> x;
			for(int j = 0;j < 256;j++){
				for(int k = 0;k < m;k++){
					int d = j + c[k];
					if(d < 0) d = 0;
					else if(d > 255) d = 255;
					dp[i + 1][d] = min(dp[i + 1][d],dp[i][j] + (x - d) * (x - d));
				}
			}
		}
		int mi = INF;
		for(int i = 0;i < 256;i++) mi = min(mi,dp[n][i]);
		cout << mi << endl;
	}
	return 0;
}