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 <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define show(a, n) rep(i,n) {cout<<a[i]<<' ';} cout<<endl;

using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;

const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100010;

ll calc_diff(vll& c, vll& x) {
	int n = x.size();
	int m = c.size();
	vector<vll> dp(n+1, vll(256, INFL));
	dp[0][128] = 0;
	rep(i, n) rep(j, 256) rep(k, m) {
		int l = j + c[k];
		if(l < 0) l = 0;
		else if(l > 255) l = 255;
		dp[i+1][l] = min(dp[i][j] + (l-x[i])*(l-x[i]), dp[i+1][l]);
	}
	ll ret = INFL;
	rep(j, 256) ret = min(dp[n][j], ret);
	return ret;
}

int main() {
//	cout << fixed << setprecision(15);
	vll ans, c, x;
	while(true) {
		int n, m;
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		c = vll(m);
		rep(i, m) cin >> c[i];
		x = vll(n);
		rep(i, n) cin >> x[i];
		ans.push_back(calc_diff(c, x));
	}
	for(auto i : ans) cout << i << endl;
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
#define min(a,b) (a>b?b:a)
int N,M,C[20],x[20005];
long long res,dp[20005][20][2]={0};
int main()
{
	for(;scanf("%d%d",&N,&M),N+M;)
	{
		res=100000000000000;
		memset(dp,0x7f,sizeof(dp));
		for(int i=0;i<M;i++)scanf("%d",&C[i]);
		for(int j=1;j<=N;j++)scanf("%d",&x[j]);
		for(int i=0;i<M;i++)
		{
			dp[0][i][0]=128;
			dp[0][i][1]=0;
		}
		for(int i=1;i<=N;i++)
		{
			for(int k=0;k<M;k++)
				for(int j=0;j<M;j++)
				{
					long long p=dp[i-1][k][0]+C[j];
					if(p>255)p=255;
					if(p<0)p=0;
					int a=x[i]-p;
					int tmp=a*a;
					if(dp[i-1][k][1]+tmp<dp[i][j][1])
					{
						dp[i][j][1]=dp[i-1][k][1]+tmp;
						dp[i][j][0]=p;
					}
				}
		}
		for(int i=0;i<M;i++)
			res=min(res,dp[N][i][1]);
		printf("%lld\n",res);
	}
	return 0;
}

C++: #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

int n,m;
int c[16],x[20000];

long dp[20000][256];

long rec(int p, int y){ //?????¨p???????????¨???????????????????????????????????????y???x[n]??¨????????????????????????
	if(dp[p][y]>=0) return dp[p][y];
	
	if(p==n) return 0;
	
	long ret=LONG_MAX;
	for(int i=0; i<m; ++i){ //??????????????????????????¨????????????????????°????????????
		int ny = y+c[i];
		if(ny<0) ny=0;
		else if(ny>255) ny=255;
		
		ret = min(ret, rec(p+1,ny)+(ny-x[p])*(ny-x[p]));
	}
	
	return dp[p][y]=ret;
}

int main(){
	while(1){		
		//input
		scanf(" %d %d", &n, &m);
		if(n==0) break;
		
		for(int i=0; i<m; ++i) scanf(" %d", &c[i]);
		for(int i=0; i<n; ++i) scanf(" %d", &x[i]);	
		
		memset(dp,-1,sizeof(dp));
		printf("%ld\n", rec(0,128));
	}
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>

#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()

using namespace std;
const int inf = 1001001000;

void print(vector<vector<int>> a){
	for (int i=0;i<a.size();i++){
		for (int j=0;j<a[i].size();j++){
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}

void print(vector<vector<long long int>> a){
	for (int i=0;i<a.size();i++){
		for (int j=0;j<a[i].size();j++){
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}

void print(vector<int> a){
    int n = a.size();
    for (int j=0;j<n;j++) {
        if (j != n-1) cout << a[j] << " ";
        else cout << a[j] << endl;
    }
}

int main(){
	while (true){
		int n, m;
		cin >> n >> m;
		if (n == 0 && m == 0)
			break;
		vector<int> c(m);
		vector<int> y(n);
		rep(i, m) cin >> c[i];
		rep(i, n) cin >> y[i];
		vector<vector<int>> dp(n + 1, vector<int>(256, inf));
		dp[0][128] = 0;
		rep(i, n)
		{
			rep(j,256){
				if (dp[i][j] == inf){
					continue;
				}
				rep(k,m){
					if (j + c[k] < 0) dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + (0 - y[i]) * (0 - y[i]));
					else if (j + c[k] > 255) dp[i + 1][255] = min(dp[i + 1][255], dp[i][j] + (255 - y[i]) * (255 - y[i]));
					else dp[i + 1][j + c[k]] = min(dp[i + 1][j + c[k]], dp[i][j] + (j + c[k] - y[i]) * (j + c[k] - y[i]));
				}
			}

		}
		int ans = inf;
		rep(i, 256) ans = min(ans, dp[n][i]);
		cout << ans << endl;
	}

	return 0;
}