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>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;

const int big = 100000000;
int main(){
  while(1){
    int n, m;
    cin >> n >> m;
    if (n == 0 && m == 0) break;
    vector<int> c(m);
    vector<int> x(n);
    rep(i, m) cin >> c[i];
    rep(i, n) cin >> x[i];
    vector<vector<int>> dp(n+1, vector<int>(256, big));
    dp[0][128] = 0;
    int y;
    rep(i, n)rep(j, 256)rep(k, m){
      y = j + c[k];
      if (y < 0) y = 0;
      if (y > 255) y = 255;
      dp[i+1][y] = min(dp[i+1][y], dp[i][j] + (y - x[i]) * (y - x[i]));
    }
    int ans = big;
    rep(i, 256) if(ans > dp[n][i]) ans = dp[n][i];
    cout << ans << endl;
  }
  
  return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
#include <complex>
#define repi(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define endl "\n"
#define ing long long
using namespace std;
const int INF = 1<<30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl

#define MAX 255
signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(true){
        int N, M;
        vector<int> C, x;
        vector<vector<int>> dp;
        int ans = INF;
        
        cin>>N>>M;

        if(!N && !M) break;

        C.resize(M);
        x.resize(N);
        
        dp.resize(N+3, vector<int>(MAX+10, INF));
        
        for(int i = 0; i < M; i++){
            cin>>C[i];
        }

        for(int i = 0; i < N; i++){
            cin>>x[i];
        }

        dp[0][128] = 0;
        
        for(int i = 0; i < N; i++){
            for(int j = 0; j <= MAX; j++){
                if(dp[i][j] >= INF) continue;
                for(int k = 0; k < M; k++){
                    int num = j + C[k];

                    
                    if(num >= 0 && num <= MAX){
                        dp[i+1][num] = min(dp[i][j] + (num-x[i])*(num-x[i]),dp[i+1][num]);
                    } else if(num < 0){
                        num = 0;
                        dp[i+1][num] = min(dp[i][j] + (num-x[i])*(num-x[i]),dp[i+1][num]);
                    } else {
                        num = MAX;
                        dp[i+1][num] = min(dp[i][j] + (num-x[i])*(num-x[i]),dp[i+1][num]);
                    }
                }
            }
        }
        for(int i = 0; i <= MAX; i++){
            ans = min(ans, dp[N][i]);
        }

        cout<<ans<<endl;
    }
    return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define INF 1<<30
using namespace std;

int main(){
  int n,m;
  while(cin>>n>>m,n+m){
    vector<int> cn(m);
    vector<int> xn(n);
    for(int i=0;i<m;i++) cin>>cn[i];
    for(int i=0;i<n;i++) cin>>xn[i];
    vector<vector<int> > dp(n+1,vector<int>(256,INF));
    dp[0][128]=0;
    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++){
	if(dp[i][j] == INF) continue;
	for(int k=0;k<m;k++){
	  int calc=j+cn[k];
	  if(calc < 0) calc = 0;
	  if(calc > 255) calc= 255;
	  int t=(xn[i]-calc)*(xn[i]-calc)+dp[i][j];
	  dp[i+1][calc]=min(dp[i+1][calc],t);
	}
      }
    }
    int _min=1<<30;
    for(int i=0;i<256;i++){
      _min=min(_min,dp[n][i]);
    }
    cout<<_min<<endl;
  }

  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
 
using namespace std;
 
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define rep(i,n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
 

 
const int INF = 1000000;
const double EPS = 1e-8;
const int mod = 1e9 + 7;
const ll LINF = 1e18;

ll dp[20010][256];

int main(){
	int n, m;
	int nxt;
	while(cin>>n>>m && n && m){
		vi c(m), x(n);
		rep(i, m) cin>>c[i];
		rep(i, n) cin>>x[i];
		rep(i, 20010) rep(j, 256) dp[i][j] = LINF;

		for(int i = 0; i < m; i++){
			nxt = 128+c[i];
			nxt = max(nxt, 0);
			nxt = min(nxt, 255);
			dp[0][nxt]=min(dp[0][nxt], (ll)(x[0]-nxt)*(x[0]-nxt));
		}
		for(int i = 1; i < n; i++){
			for(int j = 0; j < 256; j++){
				for(int k = 0; k < m; k++){
					nxt = j + c[k];
					nxt = max(nxt, 0);
					nxt = min(nxt, 255);
					dp[i][nxt] = min(dp[i][nxt], dp[i-1][j]+(x[i]-nxt)*(x[i]-nxt));
				}
			}
		}
		ll ans = LINF;
		for(int i = 0; i < 256; i++){
			ans = min(dp[n-1][i], ans);
		}
		cout<<ans<<endl;
	}
}