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 <bits/stdc++.h>

#define rep(n) for(int i=0;i<n;i++)

using namespace std;

typedef long long ll;

int n,m;
ll ans = LLONG_MAX;
ll c[16], x[200001];

void dfs(int index, ll score, ll prev){
    if(index == n){
        ans = min(ans, score);
        return;
    }
    rep(m){
        ll now = min(255LL, max(0LL, prev+c[i]));
        ll diff = x[index]-now;
        dfs(index+1, score+diff*diff, now);
    }
}

int main(){
    while(scanf("%d%d", &n, &m) && n){
        rep(m) scanf("%lld", &c[i]);
        rep(n) scanf("%lld", &x[i]);
        dfs(0, 0LL, 128LL);
        printf("%lld\n", ans);
    }
}

C++: #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;

template<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }

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

	const int INF = 0xfffffff;

	for(int n, m; cin >> n >> m, n;) {
		vector<int> c(m);
		for(int i = 0; i < m; ++i)
			cin >> c[i];

		vector<int> dp(256, INF);
		dp[128] = 0;
		for(int i = 0; i < n; ++i) {
			int x;
			cin >> x;

			vector<int> tmp(256, INF);
			for(int j = 0; j < 256; ++j) {
				for(int k = 0; k < m; ++k) {
					const int next = max(0, min(255, j + c[k]));
					const int diff = x - next;
					chmin(tmp[next], dp[j] + diff * diff);
				}
			}

			dp.swap(tmp);
		}

		cout << *min_element(dp.begin(), dp.end()) << endl;
	}

	return EXIT_SUCCESS;
}

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

#define INF 1e9
#define llINF 1e18
#define MOD 1e9+7
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define sqr(x) (x)*(x)
using namespace std;
vector<int>C(5000);
vector<int>x(100000);
ll ans=0;
int n,m;
int main(){
  while(cin>>n>>m,n){
    ans=llINF;
    ll dp[n+20][530]={};
    for(int i=0;i<n+2;i++)
      for(int j=0;j<520;j++)
	dp[i][j]=llINF;
    for(int i=0;i<m;i++)
      cin>>C[i];
    for(int i=0;i<n;i++){
      cin>>x[i];
      x[i]+=260;
    }

    dp[0][128+260]=0;
    for(int i=1;i<=n;i++){
      for(int j=5;j<=515;j++){
	if(dp[i-1][j]!=llINF){
	  for(int k=0;k<m;k++){
	    int num=j+C[k];
	    if(num>=515)num=515;
	    else if(num<=5)num=5;
	    //cout<<i<<" "<<
	    dp[i][num]=min(dp[i-1][j]+sqr((num-x[i-1])),dp[i][num]);
	  }
	}
      }
    }
    for(int i=0;i<520;i++){
      ans=min(dp[n][i],ans);
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#define NUM 256
using namespace std;

int main(){
  int n,m;
  cout << "hello world" << endl;
  while(cin>>n>>m,n){
    int dp[n+1][NUM];
    for(int i=0;i<=n;i++)
      for(int j=0;j<NUM;j++)
	dp[i][j]=1<<30;
    dp[0][128]=0;
    int c[20],x[n+1];
    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<NUM;j++){
	for(int k=0;k<m;k++){
	  if(j+c[k]<0){
	    dp[i+1][0]=min(dp[i+1][0],dp[i][j] + x[i]*x[i]);
	  }else if(j+c[k]>255){
	    dp[i+1][255]=min(dp[i+1][255],dp[i][j] + (x[i]-255)*(x[i]-255));
	  }else{
	    dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j] + (x[i]-j-c[k])*(x[i]-j-c[k]));
	  }
	}
      }
    }
    // for(int j=0;j<256;j++){
    //   for(int i=0;i<n;i++){
    // 	cout << dp[i][j] << " ";
    //   }
    //   cout << endl;
    // }

    int res=1<<30;
    for(int i=0;i<NUM;i++)res=min(res,dp[n][i]);
    cout << res << endl;
  }
  return 0;
}

C++: #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()
int dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
typedef vector<vector<int> > VVI;
const int INF = 1e9;
const double EPS = 1e-6;

int round(int y)
{
	y = min(y, 255);
	y = max(y, 0);
	return y;
}

int sq(int x)
{
	return x*x;
}

int dp[20000][256];

int main()
{
	int N, M;
	while (cin>>N>>M, N) {
		vector<int> C(M), x(N);
		rep(i, M) cin>>C[i];
		rep(i, N) cin>>x[i];
		
		
		fill(dp[0], dp[0]+20000*16, INF);
		
		for (int k=0; k<M; k++) {
			int y = round(128 + C[k]);
			dp[0][y] = sq(x[0]-y);
		}
		
		for (int i=1; i<N; i++) {
			for (int j=0; j<256; j++) {
				if (dp[i-1][j] >= INF) continue;
				for (int k=0; k<M; k++) {
					int y = round(j+C[k]);
					dp[i][y] = min(dp[i][y], dp[i-1][j]+sq(x[i]-y));
				}
			}
		}
		
		int ans=INF;
		for (int j=0; j<256; j++) {
			ans = min(dp[N-1][j], ans);
		}
		cout << ans << endl;
	}
}