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>

using namespace std;

int main()
{
    int n, m;
    
    while (scanf("%d %d", &n, &m) && n){
        int C[16];
        long long dp[2][256];
        
        for (int i = 0; i < m; i++) scanf("%d", C + i);
        
        fill (dp[0], dp[0] + 256, 1000000000000000000ll);
        fill (dp[1], dp[1] + 256, 1000000000000000000ll);
        
        dp[0][128] = 0;
        
        int t = 0;
        for (int i = 0; i < n; i++){
            int x;
            scanf("%d", &x);
            
            fill(dp[1 - t], dp[1 - t] + 256, 1000000000000000000ll);
            for (int j = 0; j < m; j++){
                for (int k = 0; k < 256; k++){
                    int y = max(0, min(255, k + C[j]));
                    dp[1 - t][y] = min(dp[1 - t][y], dp[t][k] + (x - y) * (x - y));
                }
            }
            t = 1 - t;
        }
        
        printf("%lld\n", *min_element(dp[t], dp[t] + 256));
    }
    
    return (0);
}

C++: #include <bits/stdc++.h>
#ifdef _DEBUG
#include "debug.hpp"
#else
#define debug(...)
#endif
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
template<class T, class U> inline bool chmax(T &a, const U &b) { if(a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if(a > b) { a = b; return true; } return false; }

ll dp[20100][256];

ll add(const ll &a) {
  if(a > 255) return 255;
  else if(a < 0) return 0;
  else return a;
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  for(;;) {
    int n, m;
    cin >> n >> m;
    if(n == 0 && m == 0) break;
    vector<int> c(m), x(n);
    rep(i,m) cin >> c[i];
    rep(i,n) cin >> x[i];
    rep(i,20100) rep(j,256) dp[i][j] = LINF;
    dp[0][128] = 0;
    rep(i,n) rep(j,256) {
      if(dp[i][j] == LINF) continue;
      rep(k,m) {
        chmin(dp[i+1][add(j+c[k])], dp[i][j]+(add(j+c[k])-x[i])*(add(j+c[k])-x[i]));
      }
    }
    ll ans = LINF;
    rep(j,256) chmin(ans, dp[n][j]);
    cout << ans << '\n';
  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 10000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, m;
int c[16 + 1], x[20000 + 1];
int dp[16 + 1][256 + 1];

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 20){
			REP(j, 300){
				dp[i][j] = INF;
			}
		}
		REP(i, m){
			cin >> c[i];
		}
		REP(i, n){
			cin >> x[i];
		}
		dp[0][128] = 0;
		REP(i, n){
			REP(j, m){
				REP(k, 256){
					int num = k + c[j];
					if (num < 0)num = 0;
					if (num > 255)num = 255;
					dp[i + 1][num] = min(dp[i][k] + (x[i] - num)*(x[i] - num), dp[i + 1][num]);
				}
			}
		}
		int ans = INF;
		REP(i, 300){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 1000000000;

int i,j,k,n,m,c[17],N[20001],dp[256][20001],x;

int main(){
  
  while(1){
    cin >> n >> m;
    if( n == 0 && m ==  0 ) break;
  
    for( i = 0; i < m; i++ ) cin >> c[i];
    for( i = 0; i < n; i++ ) cin >> N[i];
    
    for( i = 0; i < 256; i++ ){
      for( j = 0; j <= n; j++ ){
	dp[i][j] = MAX;
      }
    }
    
    dp[128][0] = 0;
    //  int data[20000];
      for( j = 0; j < n; j++ ){
    for( i = 0; i <= 255; i++ ){
	//	int Min = 100000;
	for( k = 0; k < m; k++ ){
	  x = ( i + c[k] );
	  if( x < 0 ) x = 0;
	  if( x > 255 ) x = 255;
	  //dp[x][0] = 0;
	  dp[x][j+1] = min( dp[x][j+1], dp[i][j] + (x - N[j]) *( x - N[j] ) );

	  /*  if( Min > ( x - N[j] ) * ( x - N[j] ) ){
	    Min = ( x - N[j] ) * ( x - N[j] );
	    cout << "Min" << " " << Min << endl;
	    data[j] = x;
	  }
	  */
	}
      }
    }
    
      /* for( i = 0; i < 256; i++ ){
      cout << "i" << " " << i << " ";
      for( j = 0; j <= n; j++ ){
	cout <<  dp[i][j] << " ";
      }
      cout << endl;
      }*/
    int Min = 1000000000;

     for( i = 0; i < 256; i++ ){
       if ( Min > dp[i][n] ){
	 Min = dp[i][n];
	 }
     }
     cout << Min << endl;
  }
  
  return 0;
}