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<climits>
#include<algorithm>
using namespace std;

int main()
{
    int n, m;
    while(cin>>n>>m, n|m) {
        vector<long long int> c(m), x(n);
        for(int i=0; i<m; i++) cin>>c[i];
        for(int i=0; i<n; i++) cin>>x[i];
        vector< vector<long long int> > dp(n+1, vector<long long int>(255+1, LONG_LONG_MAX/2));
        dp[0][128] = 0;
        for(int i=0; i<n; i++) {
            for(int j=0; j<=255; j++) {
                for(int k=0; k<m; k++) {
                    int l = j+c[k];
                    if(l < 0) l = 0;
                    if(255 < l) l = 255;
                    dp[i+1][l] = min(dp[i+1][l], dp[i][j]+(x[i]-l)*(x[i]-l));
                }
            }
        }
        cout<<*(min_element(dp[n].begin(), dp[n].end()))<<endl;
    }
}

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

typedef long long ll;
const ll INF = 1LL << 50;
ll dp[20010][260];
ll c[16];
ll x[20000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, m;
	while(cin >> n >> m, n) {
		for(int i = 0; i < m; i++) {
			cin >> c[i];
		}
		for(int i = 0; i < n; i++) {
			cin >> x[i];
		}

		fill((ll*)begin(dp), (ll*)end(dp), INF);
		dp[0][128] = 0;

		for(int i = 0; i < n; i++) {
			for(int j = 0; j <= 255; j++) {
				for(int k = 0; k < m; k++) {
					int nj = max(min(j + c[k], 255LL), 0LL);
					dp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + (x[i] - nj) * (x[i] - nj));
				}
			}
		}

		ll ans = INF;
		for(int j = 0; j <= 255; j++) {
			ans = min(ans, dp[n][j]);
		}
		cout << ans << endl;
	}

}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)

using namespace std;

typedef unsigned int uint;
typedef long long ll;

const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};

int getInt(){
  int ret = 0,c;
  c = getchar();
  while(!isdigit(c)) c = getchar();
  while(isdigit(c)){
    ret *= 10;
    ret += c - '0';
    c = getchar();
  }
  return ret;
}

int c[16];
int x[20000];
int n,m;

int memo[20000][256];

int solve(int now, int prev, int kabe){
  if(now == n) return 0;
  if(memo[now][prev]!=-1) return memo[now][prev];

  int ret = INT_MAX;
  REP(i,m){
    int t = min(255,max(0,prev + c[i]));
    int g = (t - x[now]) * (t - x[now]);
    if(kabe - g > 0){
      int s = solve(now+1, t, kabe-g);
      if(s == INT_MAX) continue;
      ret = min(ret, g+s);
      kabe = min(kabe,ret);
    }
  }
  return memo[now][prev] = ret;
}

int main(){
  while(scanf("%d%d",&n,&m), n+m){
    REP(i,m) scanf("%d",c+i);
    REP(i,n) scanf("%d",x+i);
    memset(memo,-1,sizeof(int)*256*n);
    printf("%d\n",solve(0,128,INT_MAX));
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

const int INF = 1 << 30;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

typedef unsigned long long ull;
typedef std::pair<int,int> P;



int N, M;
int C[16], X[20000];
int dp[20001][256];

int main(){
    while(std::cin >> N >> M, N){
        REP(i, M){
            std::cin >> C[i];
        }
    
        FOR(i, 1, N+1){
            std::cin >> X[i];
        }

        REP(i, N+1){
            REP(y, 256){
                dp[i][y] = INF;
            }
        }
        dp[0][128] = 0;

        FOR(i, 0, N){
            REP(y, 256){
                REP(j, M){
                    int ny = y+C[j];
                    if(ny < 0){ny = 0;}
                    else if(ny > 255){ny = 255;}

                    dp[i+1][ny] = std::min(dp[i+1][ny], dp[i][y] + (X[i+1]-ny) * (X[i+1]-ny));
                }
            }
        }

        // FOR(i, 1, N+1){
        //     REP(y, 256){
        //         printf("%d, ", dp[i][y]);
        //     }
        //     puts("");
        // }

        int min_sum = INF;
        REP(i, 256){
            min_sum = std::min(min_sum, dp[N][i]);
        }

        std::cout << min_sum << std::endl;
    }
}