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

int c[16], x[16];
int dp[20001][256];
int d(int a) {
	if (a < 0)return 0;
	if (a > 255)return 255;
	return a;
}
int diff(int i, int a) {
	return (x[i] - a)*(x[i] - a);
}
signed main() {
	int n, m;
	while (scanf("%d%d", &n, &m), n) {
		rep(i, m)scanf("%d", &c[i]);
		rep(i, n)scanf("%d", &x[i]);
		memset(dp, 0x3f, sizeof(dp));
		dp[0][128] = 0;
		rep(i, n)rep(j, 256) {
			if (dp[i][j] == INF)continue;
			rep(k, m) {
				int a = d(j + c[k]);
				if (a > 255 || a < 0) {
					return 0;
				}
				dp[i + 1][a] = min(dp[i + 1][a], dp[i][j] + diff(i, a));
			}
		}
		int Min = INF;
		rep(j, 256)Min = min(Min, dp[n][j]);
		printf("%d\n", Min);
	}
}

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

int main()
{
  int N,M,C[16],x[20001],y,mi;
  pair<int,int> P[20001][16];

  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++)cin>>C[i];
    for(int i=1;i<=N;i++)cin>>x[i];
    for(int i=0;i<M;i++){
      P[0][i].first=0;
      P[0][i].second=128;
    }
    for(int i=1;i<=N;i++){
      for(int j=0;j<M;j++){
        P[i][j].first=10000000;
        P[i][j].second=0;
      }
    }
    for(int i=1;i<=N;i++){
      for(int j=0;j<M;j++){
	for(int k=0;k<M;k++){
	  y=(P[i-1][k].second+C[j]);
          if(y<0)y=0;
	  if(y>255)y=255;
	  if(P[i][j].first>P[i-1][k].first+(x[i]-y)*(x[i]-y)){
	    P[i][j].first=P[i-1][k].first+(x[i]-y)*(x[i]-y);
            P[i][j].second=y;
	  }
	}
      }
    }
    mi=10000000;
    for(int i=0;i<M;i++)mi=min(mi,P[N][i].first);
    cout<<mi<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#define int long long

using namespace std;

signed main() {
  int n, m;
  while(cin >> n >> m, n != 0) {
    vector<int> cs(m);
    for (int i = 0; i < m; i++) {
      cin >> cs[i];
    }
    vector<int> y(n);
    for (int i = 0; i < n; i++) {
      cin >> y[i];
    }
    const int inf = 10000000000ll;
    vector<vector<int>> dp(n+1, vector<int>(256, inf));
    dp[0][128] = 0;
    for (int i=0; i<n; i++){
      for (int k=0; k < 256; k++) {
        for (auto c : cs) {
          int to = k + c;
          to = (to < 0) ? 0 :
               (to > 255) ? 255 :
               to;
          int cost = (to - y[i]) * (to - y[i]);
          dp[i+1][to] = min(dp[i+1][to], dp[i][k] + cost);
        }
      }
    }
    int res = inf;
    for (int k=0; k < 256; k++) {
      res = min(res, dp[n][k]);
    }
    cout << res << endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define int             long long
#define rep(i, n)       for(int i=0; i<(n); ++i)
#define REP(i, d, n)    for(int i=(d); i<(n); ++i)
#define all(v)          v.begin(), v.end()
using P = pair<int, int>;

constexpr int INF = 1LL << 60;

template<class T> 
inline bool chmax(T &a, const T &b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<class T> 
inline bool chmin(T &a, const T &b){
    if(a > b){
        a = b;
        return true;
    }
    return 0;
}

signed main() {

    int n, m;
    while(true){
        cin >> n >> m;
        if(n == 0 && m == 0){
            break;
        }
        
        vector<int> c(m);
        rep(i, m){
            cin >> c[i];
        }
        vector<int> x(n);
        rep(i, n){
            cin >> x[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<=255; j++){
                if(dp[i][j] == INF){
                    continue;
                }
                for(int k=0; k<m; k++){
                    if(c[k] < 0){
                        chmin(dp[i+1][max(0LL,c[k]+j)], dp[i][j]+(max(0LL,c[k]+j)-x[i])*(max(0LL,c[k]+j)-x[i]));
                    }
                    else{
                        chmin(dp[i+1][min(255LL,c[k]+j)], dp[i][j]+(min(255LL,c[k]+j)-x[i])*(min(255LL,c[k]+j)-x[i]));
                    }
                }
            }
        }
        
        int ans = INF;
        for(int i=0; i<=255; i++){
            if(dp[n][i] == INF) continue;
            chmin(ans,dp[n][i]);
        }
        cout << ans << endl;
    }
    
    
    return 0;
}