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>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())

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

using namespace std;
LL dp[256][2];
int d(int v){
  return v*v;
}
int ran(int v){
  if(v<0) return 0;
  return min(255,v);
}
int main(void)
{
  for(;;){
    int n,m;
    cin >> n >> m;
    if(!n&&!m) return 0;
    vector<int> alt;
    alt.resize(m);
    REP(i,m) cin >> alt[i];
    REP(i,256) dp[i][0]=2147483647;
    dp[128][0]=0;
    REP(i,n){
      int x;
      cin >> x;
      REP(j,256) dp[j][(i+1)%2]=2147483647;
      REP(j,256){
	REP(k,m) dp[ran(j+alt[k])][(i+1)%2]=min(dp[ran(j+alt[k])][(i+1)%2],dp[j][i]+d(ran(j+alt[k])-x));
      }
      //REP(j,256) if(dp[j][(i+1)%2]<100000) cout << j << ' ' << i << ' ' << dp[j][(i+1)%2] << endl;
    }
    LL answer=2147483647;
    //REP(i,256) cout << dp[i][n%2] << endl;;
    REP(i,256) answer=min(answer,dp[i][n%2]);
    cout << answer << endl;
    
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
    while (1) {
        int N, M;
        cin >> N >> M;
        if (N == 0 && M == 0) break;
        vector<int> C(M), x(N);
        rep(i, M) cin >> C[i];
        rep(i, N) cin >> x[i];

        vector<vector<int>> dp(N + 1, vector<int>(256, 1e9));
        dp[0][128] = 0;
        rep(i, N) {
            rep(j, 256) {
                if (dp[i][j] == 1e9) continue;
                rep(k, M) {
                    int to = j + C[k];
                    if (to < 0) to = 0;
                    else if (to > 255) to = 255;
                    chmin(dp[i + 1][to], dp[i][j] + (to - x[i]) * (to - x[i]));
                }
            }
        }

        int ans = 1e9;
        rep(i, 256) {
            chmin(ans, dp[N][i]);
        }

        cout << ans << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <math.h>
#include <stack>
using namespace std;
typedef long long ll;

int dp[20020][256];

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	while(1){
		int n,m; cin >> n >> m;
		if(n==0&&m==0)break;
		vector<int> c(m),x(n);
		for(int i=0;i<m;i++){
			cin >> c[i];
		}
		for(int i=0;i<n;i++){
			cin >> x[i];
		}
		for(int i=0;i<=n;i++){
			for(int j=0;j<256;j++){
				dp[i][j]=1e9;
			}
		}
		dp[0][128]=0;
		for(int i=0;i<n;i++){
			for(int j=0;j<256;j++){
				if(dp[i][j]==1e9)continue;
				for(int k=0;k<m;k++){
					int now=j+c[k];
					now=max(now,0);
					now=min(now,255);
					dp[i+1][now]=min(dp[i+1][now],dp[i][j]+(x[i]-now)*(x[i]-now));
				}
			}
		}
		cout << *min_element(dp[n],dp[n]+256) << endl;
	}
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

using ll = long long;
using ull = uint64_t;
using P = pair<int, int>;
constexpr double EPS = 1e-9;
constexpr int INF = 1501001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    for(;;){
        int N, M;
        cin >> N >> M;
        if(N == 0 && M == 0)    return 0;
        vector<int> C(M);
        for(int i = 0; i < M; ++i)  cin >> C[i];
        vector<vector<int>> dp(N + 1, vector<int>(256, INF));
        dp[0][128] = 0;
        for(int i = 0; i < N; ++i){
            int x;
            cin >> x;
            for(int j = 0; j <= 255; ++j){
                if(dp[i][j] == INF) continue;
                for(int k = 0; k < M; ++k){
                    int nj = j + C[k];
                    if(nj > 255)    nj = 255;
                    if(nj < 0)  nj = 0;
                    int cost = abs(x - nj) * abs(x - nj);
                    chmin(dp[i + 1][nj], dp[i][j] + cost);
                }
            }
        }
        cout << *min_element(dp[N].begin(), dp[N].end()) << '\n';
    }
}