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;
using P = pair<int, int>;

const ll INF = 1001001001001001;

ll dp[20202][300];

int main() {
    int n, m;
    while (cin >> n >> m && !(n == 0 && m == 0)) {
        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 < 20202; i++) {
            for (int j = 0; j < 300; j++) {
                dp[i][j] = INF;
            }
        }
        dp[0][128] = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                for (int k = 0; k < 300; k++) {
                    if (dp[i][k] == INF) continue;
                    ll idx = min(255, max(0, c[j] + k));
                    dp[i + 1][idx] =  min(dp[i + 1][idx], dp[i][k] + (x[i] - idx) * (x[i] - idx));
                }
            }
        }
        ll ans = INF;
        for (int k = 0; k < 300; k++) {
            ans = min(ans, dp[n][k]);
        }
        cout << ans << endl;
    }
}

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

#define GETA 256
#define INF 1e18

int err(int a, int b){ return (a - b) * (a - b); }

int main(void){
  while(true){
    int n, m;
    cin >> n >> m;
    if(n == 0 && m == 0){ break; }

    int input;
    vector<bool> c(256 + GETA, false);
    for(int i = 0; i < m; i++){
      cin >> input;
      c[input + GETA] = true;
    }

    vector<bool> lower_c(256 + GETA, false);
    vector<bool> upper_c(256 + GETA, false);
    for(int i = 1; i < 256 + GETA; i++){ lower_c[i] = c[i - 1] | lower_c[i - 1]; }
    for(int i = 256 + GETA - 2; i >= 0; i--){ upper_c[i] = c[i + 1] | upper_c[i + 1]; }

    vector<int> x(n + 1);
    for(int i = 1; i <= n; i++){ cin >> x[i]; }
    
    vector<vector<long long int> > dp(n + 1, vector<long long int>(255 + 1, INF));
    dp[0][128] = 0;
    for(int i = 1; i <= n; i++){
      for(int j = 0; j <= 255; j++){
        for(int k = 0; k <= 255; k++){
          int diff = j - k + GETA;
          if(c[diff] || (j == 255 && upper_c[diff]) || (j == 0 && lower_c[diff])){
            dp[i][j] = min(dp[i][j], dp[i - 1][k] + err(j, x[i]));
          }
        }
      }
    }

    long long int ans = INF;
    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;

//#define int int64_t

#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,x,...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i, 0, n)
#define rep(...) CHOOSE((__VA_ARGS__,REP1,REP2,REP3))(__VA_ARGS__)

#define all(c) begin(c), end(c)
#define maxup(ans, x) (ans = (ans < x ? x : ans))
#define minup(ans, x) (ans = (ans > x ? x : ans))

#define breakif(cond) if(cond) break; else

template<typename T>
inline void input(vector<T>& v) { for (auto& x : v) cin >> x; }

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

const int INF = 1 << 29;

signed main() {
	int n;
	while (cin >> n && n) {
		int m; cin >> m;
		V cs(m); input(cs);
		V xs(n); input(xs);
		VV dp(n + 1, V(256, INF));

		dp[0][128] = 0;
		rep(i, n) {
			int x = xs[i];
			rep(j, 256) {
				rep(k, m) {
					int c = cs[k];
					int val = max(0, min(j + c, 255));
					minup(dp[i + 1][val], dp[i][j] + pow(x - val, 2));
				}
			}
		}
		cout << *min_element(all(dp[n])) << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
int rnd(int v){
	if (v < 0) return 0;
	if (v > 255) return 255;
	return v;
}
int diff(int a, int b){
	return (a - b) * (a - b);
}

int n, m;
int c[16];
int x[20000];
int dp[20001][256];

int main()
{
	while (scanf("%d %d", &n, &m), n){
		fill((int*)dp, (int*)dp + sizeof(dp) / sizeof(int), INF);
		
		for (int i = 0; i < m; i++){
			scanf("%d", &c[i]);
		}
		for (int i = 0; i < n; i++){
			scanf("%d", &x[i]);
		}
		
		dp[0][128] = 0;
		for (int i = 0; i < n; i++){
			for (int j = 0; j < 256; j++){
				for (int k = 0; k < m; k++){
					int to = rnd(j + c[k]);
					dp[i + 1][to] = min(dp[i + 1][to], dp[i][j] + diff(to, x[i]));
				}
			}
		}
		
		int mini = INF;
		for (int i = 0; i < 256; i++){
			mini = min(mini, dp[n][i]);
		}
		
		printf("%d\n", mini);
	}
}