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 <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
 
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define MCLR(a) memset((a), -1 ,sizeof(a))
#define SZ(a) (sizeof(a))
#define FILL(a,v) fill((int*)a,(int*)(a+(SZ(a)/SZ(*(a)))),v)

bool cheak(int x,int y,int xMax,int yMax)
{return x >= 0 && y >= 0 && xMax > x && yMax > y;}
const int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
const int INF = 2147483648/3;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

const int MAX = 20010;
int dp[MAX][256];

int main()
{
	int n,m;
	while(cin >> n >> m && (n || m))
	{
		int c[20],x[MAX];
		REP(i,m)cin >> c[i];
		REP(i,n)cin >> x[i];
		
		FILL(dp,INF);
		dp[0][128] = 0;

		REP(i,n)
		REP(j,256)
		if(dp[i][j] != INF)
		REP(k,m)
		{
			int tmp = j+c[k];
			int oldval = dp[i][j];

			if(tmp < 0)
				tmp = 0;
			if(tmp >= 256)
				tmp = 255;
			
			int val = pow(x[i]-tmp,2);
			if(val < dp[i+1][tmp])
				dp[i+1][tmp] = val+oldval;
		}

		int ans = INF;
		REP(j,256)
		{
			ans = min(dp[n][j],ans);
		}


		cout << ans << endl;
	}

	return 0;

}

C++: #include<cstdio>
#include<algorithm>
#include<vector>
#include<deque>
#include<string>
#include<iostream>
using namespace std;
//AOJ2199
bool solve(void){//?????°???????????????????????????
	int N,M,i,j,k,q;
	const long long int big=1919114514;// >20000*256*256
	long long int ans=big;
	vector<int>cod;
	long long int dp[256];
	long long int ddp[256];
	for(i=0;i<=127;i++){dp[i]=big;}
	dp[128]=0;
	for(i=129;i<256;i++){dp[i]=big;}
	scanf("%d %d",&N,&M);
	if(N*M==0){return false;}
	for(i=0;i<M;i++){
		scanf("%d",&q);
		cod.push_back(q);
	}
	for(i=0;i<N;i++){
		scanf("%d",&q);
		for(j=0;j<256;j++){
			for(k=0;k<cod.size();k++){
				ddp[min(255,max(j+cod[k],0))]=min(ddp[min(255,max(j+cod[k],0))],dp[j]);
			}
		}
		for(j=0;j<256;j++){
			dp[j]=ddp[j]+(q-j)*(q-j);
			ddp[j]=big;
		}
	}
	for(j=0;j<256;j++){
		ans=min(ans,dp[j]);
	}
	printf("%lld\n",ans);
	return true;
}
int main(void){while(solve()){}return 0;}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;

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

    while (true)
    {
        int n, m;
        cin >> n >> m;
        if (n == 0 && m == 0)
            break;
        VVI dp(n + 1, vector<ll>(256, INF));
        std::vector<int> c(m), x(n + 1);
        for (int i = 0; i < m; i++)
            cin >> c[i];
        for (int i = 1; i <= n; i++)
            cin >> x[i];
        //ll dp[n+1][256];
        for (int i = 0; i < n + 1; i++)
            for (int j = 0; j < 256; j++)
                dp[i][j] = INF;
        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++)
                {
                    if (j + c[k] > 255)
                        dp[i + 1][255] = min(dp[i + 1][255], dp[i][j] + (255 - x[i + 1]) * (255 - x[i + 1]));
                    else if (j + c[k] < 0)
                        dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + (x[i + 1]) * (x[i + 1]));
                    else
                        dp[i + 1][j + c[k]] = min(dp[i + 1][j + c[k]], dp[i][j] + (j + c[k] - x[i + 1]) * (j + c[k] - x[i + 1]));
                }
            }
        ll res = INF;
        for (int i = 0; i < 256; i++)
            res = min(res, dp[n][i]);
        cout << res << endl;
    }
    return 0;
}

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

using namespace std;

int main()
{
	for(int n,m;cin>>n>>m,n|m;){
		int cs[m],xs[n];
		for(int i=0;i<m;i++) cin>>cs[i];
		for(int i=0;i<n;i++) cin>>xs[i];
		
		static int dp[20001][256];
		memset(dp,0x7f,sizeof dp);
		dp[0][128]=0;
		for(int i=0;i<n;i++) for(int j=0;j<256;j++){
			if(dp[i][j]==0x7f7f7f7f) continue;
			for(int k=0;k<m;k++){
				int l=max(min(j+cs[k],255),0);
				dp[i+1][l]=min(dp[i+1][l],dp[i][j]+(l-xs[i])*(l-xs[i]));
			}
		}
		
		cout<<*min_element(dp[n],dp[n]+256)<<endl;
	}
	
	return 0;
}