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 <map>
#include <algorithm>
using namespace std;

const int INF = 1e+8;
const int MAX_M = 16;
const int MAX_N = 20000;

// dp[i][y] := i 番目までの差分の総和
int dp[2000][256];

int main(){
	int N, M;
	while( cin >> N >> M, N || M ){
		int C[MAX_M] = {0};
		
		for(int i=0 ; i < M ; i++ ){
			cin >> C[i];
		}
		
		// 初期化
		for(int i=0 ; i <= N ; i++ ){
			for(int j=0 ; j < 256 ; j++ ){
				dp[i][j] = INF;
			}
		}
		dp[0][128] = 0;
		
		for(int i=1 ; i <= N ; i++ ){
			int x;
			cin >> x;
			for(int prev=0 ; prev < 256 ; prev++ ){
				for(int m=0 ; m < M ; m++ ){
					int next = prev + C[m];
					if( next < 0 ) next = 0;
					if( next > 255 ) next = 255;
					int diff = (next - x) * (next - x);
					dp[i][next] = min( dp[i][next] , dp[i-1][prev] + diff );
				}
			}
		}
		int ans = INF;
		for(int i=0 ; i < 256 ; i++ ){
			ans = min( ans , dp[N][i] );
		}
		cout << ans << endl;
	}
}

C++: #include <stdio.h>

int a[20001][256];

int main(void){

int i,j,k;
int n,m,dummy;
int min;
int c[17];
int x[20001];



while(1){
min = 2000000000;
scanf("%d %d",&n,&m);
if(n == 0 && m == 0){
return 0;
}

for(i = 0; i < m; i++){
scanf("%d",&c[i]);
}
for(i = 0; i < n; i++){
scanf("%d",&x[i]);
}

for(i = 0; i < n + 1; i++){
for(j = 0; j < 256; j++){
a[i][j] = 2000000000;
}
}

a[0][128] = 0;

for(i = 0; i < n; i++){
for(j = 0; j < 256; j++){
if(a[i][j] != 2000000000){
for(k = 0; k < m; k++){
dummy = j + c[k];
if(dummy < 0){
dummy = 0;
}else if(dummy > 255){
dummy = 255;
}
if(a[i+1][dummy] > a[i][j] + (dummy - x[i])*(dummy - x[i])){
a[i+1][dummy] = a[i][j] + (dummy - x[i])*(dummy - x[i]);
}
}
}
}
}

for(j = 0; j < 256; j++){
if(a[n][j] > -1){
if(min > a[n][j]){
min = a[n][j];
}
}
}

printf("%d\n",min);

}
return 0;

}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;

#define BIG_NUM 2000000000

using namespace std;

int N,M;
int** dp;

void func(){
	int codeTable[M];

	for(int i = 0; i < M; i++){
		scanf("%d",&codeTable[i]);
	}

	int num;
	dp[0][128] = 0;

	for(int count = 1; count <= N; count++){
		scanf("%d",&num);

		for(int i = 0; i <= 255; i++){
			if(dp[count-1][i] != BIG_NUM){
				for(int k = 0; k < M; k++){
					if(i+codeTable[k] > 255){
						dp[count][255] = min(dp[count][255],dp[count-1][i]+(num-255)*(num-255));
					}else if(i+codeTable[k] < 0){
						dp[count][0]  = min(dp[count][0],dp[count-1][i]+(num)*(num));
					}else{
						dp[count][i+codeTable[k]] = min(dp[count][i+codeTable[k]],dp[count-1][i] + (num-(i+codeTable[k]))*(num-(i+codeTable[k])));
					}
				}
			}
		}
	}

	int minimum = BIG_NUM;

	for(int i = 0; i <= 255; i++){
		minimum = min(minimum,dp[N][i]);
	}

	printf("%d\n",minimum);

}

int main(){

	dp = new int*[20001];
	for(int i = 0; i <= 20000; i++){
		dp[i] = new int[256];
	}

	while(true){
		scanf("%d %d",&N,&M);
		if(N == 0 && M == 0)break;

		for(int i = 0; i <= N; i++){
			for(int k = 0; k <= 255; k++)dp[i][k] = BIG_NUM;
		}

		func();
	}

	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)

int INF = 100000000;
int dp[20001][256];

void slove(int n, int m){
	vint c(m);
	rep(i, m) scanf("%d", &c[i]);
	vint x(n);
	rep(i, n) scanf("%d", &x[i]);

	rep(i, 20001) rep(j, 256) dp[i][j] = INF;

	dp[0][128] = 0;
	rep(i, n){
		rep(j, 256){
			if(dp[i][j] == INF) continue;
			rep(k, m){
				int now = j + c[k];
				if(now < 0) now = 0;
				if(now > 255) now = 255;
				//dp[?????????????????????????????? 20000][????£°???????????? ??? 255] = ????????????????°????
				dp[i + 1][now] = min(dp[i + 1][now], dp[i][j] + (x[i] - now) * (x[i] - now));
			}
		}
	}
	int ans = 100000000;
	//?????????dp[n][]
	rep(i, 256){
		ans = min(ans, dp[n][i]);
	}
	printf("%d\n", ans);
	return;
}

int main(void){
	int n, m;
	while(1){
		scanf("%d %d", &n, &m);
		if(n == 0) break;
		slove(n, m);
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e8;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main(){
	int n,m;
	while(cin>>n>>m,n+m){
		vi in(n),tmp(m);
		rep(i,m)cin>>tmp[i];
		rep(i,n)cin>>in[i];
		vvi dp(n+1,vi(260));//sa 
		rep(i,n+1)rep(j,260)dp[i][j]=inf;
		dp[0][128]=0;
		
		rep(i,n){
			rep(j,260){
				if(dp[i][j]==inf)continue;
				rep(k,m){
					int d=j+tmp[k];
					if(d<0)d=0;
					if(d>255)d=255;
					dp[i+1][d]=min(dp[i+1][d],dp[i][j]+(d-in[i])*(d-in[i]));
				}
			}	
		}
		int mi=inf;
		rep(i,260)mi=min(mi,dp[n][i]);
		cout<<mi<<endl;
	}
}