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<vector>
#include<algorithm>
#define INF 10000000
using namespace std;
int main(){
	int n,m,x,cb[20];//now,now
	int temp;
	while(cin>>n>>m,n||m){
		vector<int> input;
		vector<int> dp[256];
		for(int i=0;i<m;i++){
			cin>>cb[i];
		}
		for(int i=0;i<n;i++){
			cin>>x;
			input.push_back(x);
		}cout<<8888888<<endl;
		for(int i=0;i<=n;i++)
		for(int j=0;j<=255;j++)
		dp[j].push_back(INF);
		dp[128][0]=0;
		for(int i=0;i<n;i++)
		for(int j=0;j<=255;j++){
			
				if(dp[j][i]!=INF){
					for(int k=0;k<m;k++){
						temp=j+cb[k];
						if(temp>255)
						temp=255;
						else if(temp<0)
						temp=0;
						dp[temp][i+1]=min(dp[temp][i+1],dp[j][i]+(temp-input[i])*(temp-input[i]));
					}
				}
		}
		int ans=INF;
		for(int i=0;i<=255;i++){
		if(ans>dp[i][n])
		ans=dp[i][n];
		}
		cout<<ans<<endl;
	}
	return 0;
}

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

const int MAXN = 20001;
const int MAXM = 16;
const int MAXX = 256;
const int INF = 1<<28;

int N, M;
int C[MAXM], x[MAXN];
int dp[2][MAXX];

int main() {
  while(cin >> N >> M && (N|M)) {
    for(int i = 0; i < M; ++i) cin >> C[i];
    for(int i = 0; i < N; ++i) cin >> x[i];
    fill(dp[0], dp[2], INF);
    dp[0][128] = 0;
    for(int i = 0; i < N; ++i) {
      const int now = i & 1, next = 1 - now;
      for(int j = 0; j < MAXX; ++j) dp[next][j] = INF;
      for(int j = 0; j < MAXX; ++j) {
        for(int k = 0; k < M; ++k) {
          int nj = min(MAXX - 1, j + C[k]);
          dp[next][nj] = min(dp[next][nj],
                             dp[now][j] + (x[i] - nj) * (x[i] - nj));
        }
      }
    }
    cout << *min_element(dp[N&1], dp[N&1] + MAXX) << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <string.h>
#include <algorithm>
#include <climits>

#define M 20
#define lengthof(x) (sizeof(x)/sizeof(*(x)))

int c[M];
int sum[256];
int bsum[256];

using namespace std;

int main(void)
{
	int n,m;
	int x;
	int i1,i2,i3;
	int minn;
	int temp;

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

		memset(bsum,-1,sizeof(bsum));
		bsum[128]=0;

		for(i1=0;i1<m;i1++){
			cin>>c[i1];
		}

		for(i1=0;i1<n;i1++){
			cin>>x;
			fill((int*)sum,(int*)(sum+lengthof(sum)),INT_MAX);
			for(i2=0;i2<256;i2++){
				if(bsum[i2]!=-1){
					for(i3=0;i3<m;i3++){
						temp=i2+c[i3];
						if(temp<0) temp=0;
						if(255<temp) temp=255;

						sum[temp]=min(sum[temp],bsum[i2]+(temp-x)*(temp-x));
					}
				}
			}

			for(i2=0;i2<256;i2++){
				if(sum[i2]<INT_MAX) bsum[i2]=sum[i2];
				else bsum[i2]=-1;
			}
		}

		minn=sum[0];
		for(i1=0;i1<256;i1++){
			if(minn>sum[i1]) minn=sum[i1];
		}

		cout<<minn<<endl;

	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
void solve(int n,int m){
    int c[m];
    for(int i=0;i<m;i++)scanf("%d",&c[i]);
    vector<long long> dp(256,1e18);
    dp[128]=0;
    for(int i=0;i<n;i++){
        int x;scanf("%d",&x);
        vector<long long> ndp(256,1e18);
        for(int j=0;j<256;j++){
            if(dp[j]==1e18)continue;
            for(int k=0;k<m;k++){
                int p=min(255,max(0,j+c[k]));
                ndp[p]=min(ndp[p],dp[j]+(x-p)*(x-p));
            }
        }
        dp=ndp;
    }
    long long ans=1e18;
    for(int i=0;i<256;i++){
        ans=min(ans,dp[i]);
    }
    printf("%lld\n",ans);
}
int main(){
    while(true){
        int n,m;scanf("%d%d",&n,&m);
        if(n==0 and m==0)break;
        solve(n,m);
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cstring>
#include <queue>

#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define MP make_pair
using namespace std;

typedef vector<int> vi;
typedef pair<int, int> P;
typedef long long ll;

int dp[20000][256];

int main(){
	//freopen("test.txt", "r", stdin);
	int n, m;
	while(cin >> n >> m, n|m){
		vector<int> C(m);
		rep(i, m) cin >> C[i];
		vector<int> x(n);
		rep(i, n) cin >> x[i];

		rep(i, 20000) rep(j, 256) dp[i][j] = 2<<29;

		rep(i, m){
			int val = 128+C[i];
			if(val < 0) val = 0;
			if(val > 255) val = 255;
			dp[0][val] = (x[0]-val)*(x[0]-val);
		}
		rep(i, n-1){
			rep(j, 256){
				if(dp[i][j] == 2<<29) continue;
				rep(k, m){
					int val = j+C[k];
					if(val < 0) val = 0;
					if(val > 255) val = 255;
					int d = (x[i+1]-val)*(x[i+1]-val);
					dp[i+1][val] = min(dp[i+1][val], dp[i][j]+d);
				}
			}
		}
		int ans = 2<<29;
		rep(i, 256){
			ans = min(ans, dp[n-1][i]);
		}
		cout << ans << endl;
	}

	return 0;
}