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 <iostream>
#include <vector>

using namespace std;

const int INF = 1000000000;

int clamp(int x){
	if(x < 0){ return 0; }
	if(x >= 256){ return 255; }
	return x;
}

int pow2(int x){ return x * x; }

int main(){
	while(true){
		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]; }
		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){
				if(dp[i][j] >= INF){ continue; }
				for(int k = 0; k < m; ++k){
					int y = clamp(j + c[k]);
					dp[i + 1][y] = min(
						dp[i + 1][y], dp[i][j] + pow2(y - x[i]));
				}
			}
		}
		int answer = INF;
		for(int i = 0; i < 256; ++i){
			answer = min(answer, dp[n][i]);
		}
		cout << answer << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

int c[16], x[16];
int dp[200001][256];
int d(int a) {
	if (a < 0)return 0;
	if (a > 255)return 255;
	return a;
}
int diff(int i, int a) {
	return (x[i] - a)*(x[i] - a);
}
signed main() {
	int n, m;
	while (scanf("%lld%lld", &n, &m), n) {
		rep(i, m)scanf("%lld", &c[i]);
		rep(i, n)scanf("%lld", &x[i]);
		memset(dp, 0x3f, sizeof(dp));
		dp[0][128] = 0;
		rep(i, n)rep(j, 256) {
			if (dp[i][j] == INF)continue;
			rep(k, m) {
				int a = d(j + c[k]);
				dp[i + 1][a] = min(dp[i + 1][a], dp[i][j] + diff(i, a));
			}
		}
		int Min = INF;
		rep(j, 256)Min = min(Min, dp[n][j]);
		printf("%lld\n", Min);
	}
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int N, M;
int c[16], x[20001];

int dp[20001][256];

signed main()
{
    for (int i = 0; i <= 20000; ++i) for (int j = 0; j < 256; ++j) dp[i][j] = inf;

    cin >> N >> M;

    for (int i = 0; i < M; ++i) cin >> c[i];
    for (int i = 1; i <= N; ++i) cin >> x[i];

    dp[0][128] = 0;

    for (int i = 1; i <= N; ++i) {
        for (int j = 0; j < 256; ++j) {
            if (dp[i - 1][j] != inf) {
                for (int k = 0; k < M; ++k) {
                    int v = (c[k] < 0 ? max(j + c[k], 0ll) : min(j + c[k], 255ll));
                    int w = abs(v - x[i]);
                    chmin(dp[i][v], dp[i - 1][j] + w * w);
                }
            }
        }
    }

    cout << *min_element(dp[N],dp[N]+256) << endl;
}

C++: #include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <algorithm>
#include <assert.h>
using namespace std;
typedef long long ll;

#define REP(j,n) for (int (j)=0; j<(int)(n); ++j)
#define FOR(j,k,n) for (int (j)=(k); j<(int)(n); ++j)
#define FOREQ(j,k,n) for (int (j)=(k); j<=(int)(n); ++j)

#define MEMSET(z,val) memset(z,val,sizeof(z))

int n, m;
int x[30000];
int c[100];
ll memo[30000][300];

inline ll square(ll x) { return x * x; }

ll calc(int depth, int color) {
    assert(0 <= color && color <= 255);
    if (memo[depth][color] != -1) { return memo[depth][color]; }
    if (depth == n) { return memo[depth][color] = 0; }
    ll ret = 1LL << 60;
    REP(i, m) {
        int ncolor = color + c[i];
        ncolor = max(0, min(255, ncolor));
        int cost = square(abs(x[depth + 1] - ncolor));
        ret = min(ret, calc(depth + 1, ncolor) + cost);
    }
    return memo[depth][color] = ret;
}

int main() {
    while (scanf("%d %d", &n, &m), n|m) {
        MEMSET(memo, -1);
        REP(i, m) {
            scanf("%d", &c[i]);
        }
        REP(i, n) {
            scanf("%d", &x[i + 1]);
        }
        printf("%lld\n", calc(0, 128));
    }
}