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<string>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>c,x;
#define MA 99999999
int dp[20][20002];
int main(){
    int n,m,f,ans;
    
    while(cin >>  n >>m&& n){
        for(int i=0;i<20;i++)
            for(int j=0;j<20002;j++)
                dp[i][j]=MA;
        c.clear();
        x.clear();
        ans=MA;
        for(int i=0;i<m;i++){
            cin>>f;
            c.push_back(f);
            //cout<<"c[i]: "<<c[i]<<endl;
        }
        for(int i=0;i<n;i++){
            cin>>f;
            x.push_back(f);
            //cout<<"x[i]:"<<x[i]<<endl;
        }
        dp[0][128]=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<256;j++){
                if(dp[i][j]==MA)
                    continue;
                for(int k=0;k<m;k++){
                    
                    int 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] +(x[i]-nex)*(x[i]-nex));
                   // cout<<"i: "<<i<<"     j:"<<j<<"      k: "<<k<<"      c[k]: "<<c[k]<<"      dp[i][j]: "<<dp[i][j]<<"         x[i+1]: "<<x[i+1]<<"       i+1: "<<i+1<<"        nex:"<<nex<<"       dp[i+1][nex]:"<<dp[i+1][nex]<<endl;
                }
            }
        }
        for(int j=0;j<256;j++)ans=min(ans,dp[n][j]);
        cout<<ans<<endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll dp[20202][256];

int main(){
    for(ll N, M; cin >> N >> M, N;){
        vector<ll>C(M), X(N);
        for(ll i = 0; i < M; i++)cin >> C[i];
        for(ll i = 0; i < N; i++)cin >> X[i];
        for(ll i = 0; i <= N; i++){
            for(ll j = 0; j < 256; j++)dp[i][j] = 1145141919;
        }
        dp[0][128] = 0;
        for(ll i = 0; i < N; i++){
            for(ll j = 0; j < 256; j++){
                if(dp[i][j] == 1145141919)continue;
                for(ll k = 0; k < M; k++){
                    ll 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] + (nxt - X[i])*(nxt - X[i]));
                }
            }
        }
        ll ans = dp[N][0];
        for(ll i = 0; i < 256; i++)ans = min(ans, dp[N][i]);
        cout << ans << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdlib>

using namespace std;

const int INF=1000000000;

int n,m;
int dp[256][20001];
int codeBook[20];
int input[20001];

int dfs(int lastNum,int idx){
    if(idx==n)
        return 0;
    if(dp[lastNum][idx]!=INF)
        return dp[lastNum][idx];
    int minSum=INF;
    for(int i = 0; i < m; i++){
        int nextNum=min(255,max(0,lastNum+codeBook[i]));
        minSum=min(minSum,dfs(nextNum,idx+1)+(nextNum-input[idx])*(nextNum-input[idx]));
    }
    return dp[lastNum][idx]=minSum;
}

int main(){

    while(cin>>n>>m&&!(n==0&&m==0)){
        for(int i = 0; i < 256; i++)
            for(int j = 0; j < 20001; j++)
                dp[i][j]=INF;
        for(int i = 0; i < m; i++)
            cin>>codeBook[i];
        for(int i = 0; i < n; i++)
            cin>>input[i];
        int res=dfs(128,0);
        cout<<res<<endl;
    }

    return 0;
}

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

#define IF 1300500010
#define lengthof(x) (sizeof(x) / sizeof(*(x)))

using namespace std;

int main(int argc, char const *argv[])
{
	int n,m;
	long long dp[1<<8][2];
	long long min_;

	while(1){
		cin>>n>>m;
		if(n+m==0) break;

		vector<long long> cb(m);
		vector<long long> x(n);
		for(int i1=0;i1<m;i1++){
			cin>>cb[i1];
		}

		for(int i1=0;i1<n;i1++){
			cin>>x[i1];
		}

		fill((long long*)dp,(long long *)(dp+lengthof(dp)),IF);

		dp[128][0]=0;
		for(int i1=0;i1<n;i1++){
			for(int i2=0;i2<(1<<8);i2++){
				if(dp[i2][i1%2]!=IF){

					for(int i3=0;i3<m;i3++){
						int temp=i2+cb[i3];
						if(temp<0) temp=0;
						if(temp>255) temp=255;
						dp[temp][(i1+1)%2]=min(dp[temp][(i1+1)%2],dp[i2][i1%2]+(temp-x[i1])*(temp-x[i1]));
					}
					dp[i2][i1%2]=IF;
				}

			}
		}

		min_=IF;
		for(int i1=0;i1<(1<<8);i1++){
			min_=min(min_,dp[i1][n%2]);
		}

		cout<<min_<<endl;
	}
	return 0;
}