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;

int r(int a) {
	return max(0, min(255, a));
}

int main() {
	int n, m;
	while (cin >> n >> m, n) {
		int c[16], x[20000];
		for (int i = 0; i < m; i++) {
			cin >> c[i];
		}
		for (int i = 0; i < n; i++) {
			cin >> x[i];
		}
		static int a[20000][16], e[20000][16];
		for (int j = 0; j < m; j++) {
			a[0][j] = r(128 + c[j]);
			e[0][j] = (x[0] - a[0][j]) * (x[0] - a[0][j]);
		}
		for (int i = 1; i < n; i++) {
			for (int j = 0; j < m; j++) {
				e[i][j] = 1000000000;
				for (int k = 0; k < m; k++) {
					int at = r(a[i - 1][k] + c[j]);
					int et = e[i - 1][k] + (x[i] - at) * (x[i] - at);
					if (et < e[i][j]) {
						a[i][j] = at;
						e[i][j] = et;
					}
				}
			}
		}
		int em = 1000000000;
		for (int j = 0; j < m; j++) {
			em = min(em, e[n - 1][j]);
		}
		cout << em << endl;
	}
	return 0;
}

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

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1<<30;
const ll mod = 10000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

//#define int long long
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod

int dp[20000 + 5][256];

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    while (true) {
        int n, m;
        cin >> n >> m;
        if (n == 0) break;
        int c[m] = {}, x[n] = {};
        rep(i, m) cin >> c[i];
        rep(i, n) cin >> x[i];
        rep(i, n + 1)rep(j, 256) dp[i][j] = INF;
        dp[0][128] = 0;
        rep(i, n) {
            rep(j, 256) {
                rep(k, m) {
                    if (j + c[k] < 0) {
                        dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + x[i] * x[i]);
                        continue;
                    }
                    else if (j + c[k] > 255) {
                        dp[i + 1][255] = min(dp[i + 1][255], dp[i][j] + (255 - x[i]) * (255 - x[i]));
                        continue;
                    }
                    dp[i + 1][j + c[k]] = min(dp[i + 1][j + c[k]], dp[i][j] + (j + c[k] - x[i]) * (j + c[k] - x[i]));
                }
            }
        }
        int ans = INF;
        rep(j, 256) ans = min(ans, dp[n][j]);
        cout << ans << endl;

    }
}

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

int main()
{
  int N,M,C[17],x[20002],y;
  pair<long long,int> P[20002][17];
  long long mi;
  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++)cin>>C[i];
    for(int i=1;i<=N;i++)cin>>x[i];
    for(int i=0;i<M;i++){
      P[0][i].first=0;
      P[0][i].second=128;
    }
    for(int i=1;i<=N;i++){
      for(int j=0;j<M;j++){
        P[i][j].first=100000000;
        P[i][j].second=0;
      }
    }
    for(int i=1;i<=N;i++){
      for(int j=0;j<M;j++){
	for(int k=0;k<M;k++){
	  y=(P[i-1][k].second+C[j]);
          if(y<0)y=0;
	  if(y>255)y=255;
	  if(P[i][j].first>P[i-1][k].first+(x[i]-y)*(x[i]-y)){
	    P[i][j].first=P[i-1][k].first+(x[i]-y)*(x[i]-y);
            P[i][j].second=y;
	  }
	}
      }
    }
    mi=100000000;
    for(int i=0;i<M;i++)mi=min(mi,P[N][i].first);
    cout<<mi<<endl;
  }
  return 0;
}