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>
#define INF 1e10

using namespace std;
typedef long long int ll;

int main()
{
    ll N,M;
    while(cin >> N >> M)
    {
        if(N == 0 && M == 0) break;
        vector<ll>C(M),X(N);
        for(int i = 0; i < M; i++) cin >> C[i];
        for(int i = 0; i < N; i++) cin >> X[i];
        sort(C.begin(),C.end());
        vector<vector<ll>>dp(N+1,vector<ll>(256,INF));
        vector<vector<bool>>f(N+1,vector<bool>(256,false));
        dp[0][128] = 0;
        f[0][128] = true;
        for(int i = 0; i < N; i++)
        {
            for(int j = 0; j <= 255; j++)
            {
                if(f[i][j] == false) continue;
                for(int k = 0; k < M; k++)
                {
                    if(j+C[k] > 255) dp[i+1][255] = min(dp[i+1][255],dp[i][j] + (X[i]-255)*(X[i]-255)),f[i+1][255] = true;
                    if(j+C[k] < 0) dp[i+1][0] = min(dp[i+1][0], dp[i][j] + X[i]*X[i]),f[i+1][0] = true;
                    if(j+C[k] >= 0 && j+C[k] <= 255) dp[i+1][j+C[k]] =min(dp[i+1][j+C[k]],dp[i][j] + (X[i]-(j+C[k]))*(X[i]-(j+C[k]))),f[i+1][j+C[k]] = true;
                }
            }
        }
        ll S = INF;
        for(int i = 0; i <= 255; i++) if(f[N][i]) S = min(S,dp[N][i]); 
        cout << S << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int long long 
#define REP(i, s, e) for(int i = (int)(s); i < (int)(e); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = int;
const int INF = 1e9;
ll SQ(ll x) {return x*x;}

signed main() {
  int n, m;
  while(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<int> cur(256, INF);
    cur[128] = 0;
    rep(i, n) {
      vector<int> nxt(256, INF);
      rep(j, m) {
	rep(k, 256) {
	  int tmp = k + c[j];
	  if(tmp < 0) tmp = 0;
	  if(tmp > 255) tmp = 255;
	  nxt[tmp] = min((ll)nxt[tmp], cur[k]+SQ(x[i] - tmp));
	}
      }
      swap(cur, nxt);
    }
    int ans = INF;
    for(auto& x : cur) ans = min(ans, x);
    cout << ans << endl;
  }
  return 0;
}

C++: #include <iostream>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
#define INF 100000000
using namespace std;
typedef long long ll;

int N, M, C[16], X[20000];
ll dp[20001][256];

int main(void) {
  while(cin >> N >> M, N || M) {
    REP(i, 0, M) cin >> C[i];
    REP(i, 0, N) cin >> X[i];

    REP(i, 0, N + 1) REP(j, 0, 256) dp[i][j] = INF;
    dp[0][128] = 0;

    REP(i, 0, N) REP(j, 0, 256) if(dp[i][j] < INF) REP(k, 0, M) {
      ll y = max(0, min(255, j + C[k]));
      dp[i + 1][y] = min(dp[i + 1][y], dp[i][j] + (y - X[i]) * (y - X[i]));
    }

    ll ans = INF;
    REP(i, 0, 256) ans = min(ans, dp[N][i]);
    cout << ans << endl;
  }
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
  
using namespace std;

#define pi 3.141592653589793

int main()
{
	int n, m;
	while(1){
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		int result[20001][256];
		for(int i = 0; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				result[i][j] = 10000000;
			}
		}
		result[0][128] = 0;
		int c[17], x[20001];
		for(int i = 1; i < m + 1; i++){
			cin >> c[i];
		}
		for(int i = 1; i < n + 1; i++){
			cin >> x[i];
		}
		for(int i = 1; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				int nexty = j + c[i];
				if(nexty < 0) nexty = 0;
				else if(nexty > 255) nexty = 255;
				result[i][nexty] = min(result[i][nexty], result[i - 1][j] + (x[i] - nexty) * (x[i] - nexty));
			}
		}
		int ans = 1000000;
		for(int i = 1; i < 256; i++) ans = min(ans, result[n][i]);
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<math.h>

using namespace std;

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

int INF = 10e8;
int sig[20001];
int code[16];
int dp[20001][256];

int cut(int i){
    if(i>=255){
        return 255;
    } else if(i<=0){
        return 0;
    } else {
        return i;
    }
}

int main(){
    while(1){
        int n, m;
        cin >> n >> m;
        if(n==0) break;

        REP(i, m){
            int c;
            cin >> c;
            code[i] = c;
        }

        REP(i, n){
            int s;
            cin >> s;
            sig[i+1] = s;
        }

        REP(i, n+1){
            REP(j, 256){
                dp[i][j] = INF;
            }
        }
        dp[0][128] = 0;

        REP(i, n){
            REP(j, 256){
                if(dp[i][j] != INF){
                    REP(k, m){
                        int tmpsig = cut(j+code[k]);
                        int sd = dp[i][j] + pow(tmpsig - sig[i+1], 2);
                        if(sd < dp[i+1][tmpsig]){
                            dp[i+1][tmpsig] = sd;
                        }
                    }
                }
            }
        }

        /*
        REP(i, 256){
            REP(j, n){
                cout << dp[j][i] << " ";
            }
            cout << endl;
        }
        */

        int output = INF;
        REP(i, 256){
            if(dp[n][i] < output){
                output = dp[n][i];
            }
        }
        cout << output << endl;
    }
}