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<cmath>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
const int inf=1e9+7;
const ll mod=1e9+7;

int DP[256][20005];

int main() {
    int N, M;
    vector<int> ansarr;
    while(true){
        cin>>N>>M;
        if((N==0) & (M==0)) break;
        for(int i=0;i<256;++i){
            for(int j=0;j<20005;++j){
                DP[i][j] = inf;
            }
        }
        vector<int> C(M);
        for(int i=0;i<M;++i){
            cin>>C[i];
        }
        vector<int> x(N);
        for(int i=0;i<N;++i){
            cin>>x[i];
        }
        for(int i=0;i<M;++i){
            if(128 + C[i] <= 0){
                DP[0][0] = x[0] * x[0];
            }
            else if(128 + C[i] >= 255){
                DP[255][0] = (255 - x[0]) * (255 - x[0]);
            }
            else {
                DP[128+C[i]][0] = (128+C[i]-x[0])*(128+C[i]-x[0]);
            }
        }
        for(int i=0;i<N-1;++i){
            for(int j=0;j<256;++j){
                for(int k=0;k<M;++k){
                    if(j+C[k]<=0) {
                        DP[0][i+1] = min(DP[0][i+1], DP[j][i] + x[i+1] * x[i+1]);
                    }
                    else if(j+C[k]>=255) {
                        DP[255][i+1] = min(DP[255][i+1], DP[j][i] + (255 - x[i+1]) * (255 - x[i+1]));
                    }
                    else {
                        DP[j+C[k]][i+1] = min(DP[j+C[k]][i+1], DP[j][i] + (j + C[k] - x[i+1]) * (j + C[k] - x[i+1]));
                    }
                }
            }
        }
        /**
        for(int i=0;i<256;++i){
            for(int j=0;j<N;++j){
                cout<<DP[i][j]<<" ";
            }
            cout<<endl;
        }
        cout<<endl;
        **/
        int ans = inf;
        for(int i=0;i<256;++i){
            ans = min(ans, DP[i][N-1]);
        }
        ansarr.push_back(ans);
    }
    for(int i=0;i<ansarr.size();++i){
        cout<<ansarr[i]<<endl;
    }
}

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

#define INF 1 << 29;
int dp[20002][256];

int main(int argc, const char * argv[]) {
    while(1){
        int N, M; cin >> N >> M;
        if(!N && !M) break;
        
        vector<int> c(M);
        for(int i = 0; i < M; i++) cin >> c[i];
        for(int i = 0; i < 256; i++) dp[0][i] = INF;
        dp[0][128] = 0;
        
        for(int i = 1; i <= N; i++){
            int x; cin >> x;
            for(int j = 0; j < 256; j++) dp[i][j] = INF;
            
            for(int pre = 0; pre < 256; pre++){
                for(int j = 0; j < M; j++){
                    int nx = pre + c[j];
                    if(nx >= 256) nx = 255;
                    else if(nx < 0) nx = 0;
                    
                    dp[i][nx] = min(dp[i][nx], dp[i-1][pre] + (nx-x)*(nx-x));
                }
            }
        }
        
        int ans = INF;
        for(int i = 0; i < 256; i++){
            ans = min(ans, dp[N][i]);
        }
        cout << ans<< endl;
        
    }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;
 
int main() {
 int n,m;
 while(cin >> n >> m, n) {
  vector<int> code(m), value(n);
  for (int i = 0; i < m; i++)
   cin >> code[i];
  for (int i = 0; i < n; i++)
   cin >> value[i];
  vector<vector<int> > dp(n+1, vector<int>(256, 1000000000));
  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++) {
     int val = min(255,max(0,j+code[k]));
     dp[i+1][val] = min(dp[i+1][val], dp[i][j] + (val -value[i]) * (val - value[i]));
    }
   }
  }
  int ans = 1000000000;
  for (int i = 0; i < 256; i++) {
   ans = min(ans, dp[n][i]);
  }
  cout << ans << endl;
 }
 return 0;
}

C++: /*
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2199&lang=jp
*/

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

const int INF = 1901001001;

int dp[20001][256];

void init(){
    rep(i,20001) rep(j,256) dp[i][j]=INF;
    
    dp[0][128]=0;
}

int main(){
    vector<int> ans;
    while(1){
        int n,m;
        cin >> n >> m;

        if(n==0) {
            break;
        }    

        vector<int> c(m);
        rep(i,m) cin>>c[i];
        vector<int> y(n);
        rep(i,n){
            cin >> y[i];
        }

        init();

        rep(i,n){
            vector<int> temp(256,INF);
            rep(j,256){
                rep(k,m){
                    int after = j+c[k];
                    if(after>255) after=255;
                    if(after<0) after=0;
                    
                    temp[after]=min(dp[i][j]+(y[i]-after)*(y[i]-after),temp[after]);
            }
        }
        rep(j,256) dp[i+1][j] = temp[j];
    }
    int res = INF;
    rep(i,256){
        res = min(dp[n][i],res);
    }
    //cout << "rep" << endl;
    ans.push_back(res);
}

    rep(i,ans.size()) cout << ans[i] << endl;
    
}