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 <string>
#include <stdio.h>
#include <algorithm>
using namespace std;
//方針：DP
int min(int p, int q){
	if (p < q) return p;
	return q;
}
int rss(int p, int q){
	return (p - q)*(p - q);
}
int limit(int i) {
	if (i > 255) return 255;
	if (i < 0) return 0;
	return i;
}
int main(void){
//	FILE* fp_in = freopen("data.txt", "r", stdin);
 
	vector< vector< int > > dp;
	vector<int> dpp;
	for (int i = 0; i < 20001; i++)
		dpp.push_back(1 << 30);
	for (int i = 0; i < 257; i++)
		dp.push_back(dpp);
 
	while (1){
		int N, M;
		vector<int> c, x;
		scanf("%d%d", &N, &M);
		if (N == 0 && M == 0) break;
		for (int i = 0; i < M; i++) {
			int tmp;
			scanf("%d",&tmp);
			c.push_back(tmp);
		}
		for (int i = 0; i < N; i++) {
			int tmp;
			scanf("%d",&tmp);
			x.push_back(tmp);
		}
		
		for (int i = 0; i < 256; i++)
			for (int j = 0; j < 20001; j++)
				dp[i][j] = 1 << 30;
  
		for (int i = 0; i < M; i++) {
			dp[limit(128 + c[i])][1] = rss(limit(128+c[i]), x[0]);
		}

		for (int i = 1; i < N; i++)
			for (int j = 0; j < M; j++)
				for(int k = 0; k < 256; k++)
					dp[limit(k + c[j])][i+1] = min( dp[k][i] + rss(limit(k+c[j]), x[i]) , dp[limit(k+c[j])][i+1]);

		int ans = 1 << 30;
		for (int i = 0; i < 256; i++)
			if (dp[i][N] < ans) ans = dp[i][N];
   
		cout << ans << endl;
 }
 
// while (1){}
 return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cmath>
#define inf (1<<29)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int N,M;
int C[17];
int x[20010];
int dp[20010][256];

int main()
{
  while(cin >> N >> M,N|M)
    {
      REP(i,1,M+1)cin >> C[i];
      REP(i,1,N+1)cin >> x[i];
      rep(i,20010)rep(j,256)dp[i][j] = inf;
      dp[0][128] = 0;

      rep(i,N+1)
	{
	  REP(j,1,M+1)
	    {
	      rep(k,256)
		{
		  if(dp[i][k] == inf)continue;
		  int value = k+C[j];
		  if(value < 0)value = 0;
		  else if(value > 255)value = 255;
		  dp[i+1][value] = min(dp[i+1][value],
				       dp[i][k]+(x[i+1]-value)*(x[i+1]-value));
		}
	    }
	}

      int men = inf;
      rep(i,256)men = min(men,dp[N][i]);
      cout << men << endl;
    }
  return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>c,x;
const int MA =99999999;
const int MAX_X=300;
int dp[20000][MAX_X];
int main(){
    int n,m,f,ans;
    int te=0;
    while(cin >>  n >>m&& n){
        te++;
        
        for(int i=0;i<20000;i++)
            for(int j=0;j<MAX_X;j++)
                dp[i][j]=MA;
        c.clear();
        x.clear();
        ans=MA;
        for(int i=0;i<m;i++){
            cin>>f;
            c.push_back(f);
            //cout<<"c[i]: "<<c[i]<<endl;
        }
        for(int i=0;i<n;i++){
            cin>>f;
            x.push_back(f);
            //cout<<"x[i]:"<<x[i]<<endl;
        }
//        if(te==7){
//            cout<<"her"<<endl;
//        }
        dp[0][128]=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<256;j++){
                if(dp[i][j]==MA)
                    continue;
                for(int k=0;k<m;k++){
                    
                    int 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] +(x[i]-nex)*(x[i]-nex));
                    // cout<<"i: "<<i<<"     j:"<<j<<"      k: "<<k<<"      c[k]: "<<c[k]<<"      dp[i][j]: "<<dp[i][j]<<"         x[i+1]: "<<x[i+1]<<"       i+1: "<<i+1<<"        nex:"<<nex<<"       dp[i+1][nex]:"<<dp[i+1][nex]<<endl;
                }
            }
        }
        for(int j=0;j<256;j++)ans=min(ans,dp[n][j]);
        cout<<ans<<endl;
    }
}

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

#define int ll
#define rep(i,n) for(int i=0,i##_cond=(n);i<i##_cond;++i)
#define all(a) (a).begin(),(a).end()
using ll  = long long;
using vi  = vector<int>;
using vvi = vector<vi>;
constexpr ll inf = 1ll<<30;
template<class T>bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}

signed main(){
  int n, m;
  while(cin >> n >> m, n){
    vi c(m); rep(i,m) cin >> c[i];
    vi x(n); rep(i,n) cin >> x[i];
    vvi dp(n+1, vi(256,inf)); // dp[i][j] : yi番目がjの時の最小コスト
    dp[0][128] = 0;
    rep(i,n) rep(j,256) rep(k,m){ // dp[i][j]からc[k]を使った時
      int next = j + c[k];
      if(next < 0) next = 0;
      else if(255 < next) next = 255;
      chmin(dp[i+1][next], dp[i][j] + (x[i] - next)*(x[i]-next));
    }
    cout << *min_element(all(dp[n])) << endl;
  }
}