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<string>
#include <vector>
#include <stack>
#include <map>
#include<iostream>
#include <algorithm>
#include <limits.h> 
#include <functional>

using namespace std;
int n;
int m;
int price;
int a;
int b;

struct G{
	string name;
	double value;
};
bool operator>(const G& left, const G& right)
{
	if(left.value>right.value){
		return true;
	}else if(left.value<right.value){
		return false; 
	}else{
		return left.name<right.name;
	}
}

bool operator<(const G& left, const G& right)
{
  	if(left.value>right.value){
		return false;
	}else if(left.value<right.value){
		return true; 
	}else{
		return left.name>right.name;
	}
}



int main(){
	while(true){
		cin >>n;
		if(n==0){
			break;
		}
		cin >>m;
		if(m==0){
			break;
		}
		vector<int> codebook;
		vector<int> data;
		for(int i=0;i<m;i++){
			cin >> a;
			codebook.push_back(a);
		}
		for(int i=0;i<n;i++){
			cin >> a;
			data.push_back(a);
		}
		//値,誤差値でハッシュ。
		map<int,int> hash;
		hash[128]=0;

		for(int i=0;i<n;i++){
			int d=data[i];//次のデータ
			map<int,int>::iterator it = hash.begin();		
			map<int,int> next_hash;
			while( it != hash.end() )
			{
				for(int k=0;k<m;k++){
					int f=max(min((*it).first+codebook[k],255),0);
					int div=f-d;
					int s=(*it).second+div*div;
					if(next_hash.find(f)!= next_hash.end()){
						next_hash[f]=min(next_hash[f],s);
					}else{
						next_hash[f]=s;
					}
				}
				++it;
			}
			hash=next_hash;
		}
		int mi=INT_MAX;
		map<int,int>::iterator it = hash.begin();
		while( it != hash.end() )
		{
			mi=min((*it).second,mi);
			it++;
		}
		cout << mi <<endl;
	}
}

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

int clip(int i){
    return max(0, min(255, i));
}

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

    while(1){
        int n, m;
        cin >> n >> m;

        if(n == 0) break;

        vector<int> c(m);
        rep(i, m) cin >> c[i];

        vector<int> x(n);
        rep(i, n) cin >> x[i];

        const int INF = 1001001001;
        vector<vector<int>> dp(n, vector<int>(256, INF));
        rep(i, m) dp[0][clip(128 + c[i])] = pow(clip(128+c[i])-x[0], 2);

        rep(i, n-1){
            rep(j, 256){
                if(dp[i][j] == INF) continue;
                rep(k, m){
                    dp[i+1][clip(j+c[k])] = min(dp[i+1][clip(j+c[k])], dp[i][j] + (int)pow(clip(j+c[k])-x[i+1], 2));
                }
            }
        }

        int res = INF;
        rep(i, 256) res = min(res, dp[n-1][i]);

        cout << res << "\n";

    }

    return 0;
}

C++: #include<iostream>
#include<algorithm>

using namespace std;
typedef long long ll;

ll c[16], x[20000];

ll dp[20001][256];

int main() {
	while (1) {
		int n, m;
		cin >> n >> m;
		if (n + m == 0)break;
		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] = 1e18;
		dp[0][128] = 0;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j <= 255; j++) {
				for (int k = 0; k < m; k++) {
					ll nxt = 0;
					nxt = j + c[k];
					if (nxt < 0)nxt = 0;
					if (nxt > 255)nxt = 255;
					
					dp[i + 1][nxt] = min(dp[i + 1][nxt], dp[i][j] + (x[i] - nxt) * (x[i] - nxt));
				}
			}
		}
		ll ans = 1e18;

		for (int i = 0; i < 256; i++) {
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;

	}

	return 0;
}