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++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2199

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

const int MAX = INT_MAX;

int N,M;
int dp[20001][256];

vector<int> C;
vector<int> x;

int round255(int n)
{
	if(n > 255){ return 255; }
	else if(n < 0){ return 0;}
	else{ return n; }
}

int main()
{
	while(cin >> N >> M && N)
	{
		C.resize(M);
		x.resize(N);
		fill_n((int *)dp, sizeof(dp)/sizeof(int), MAX);

		rep(i,M){ cin >> C[i]; }
		rep(i,N){ cin >> x[i]; }

		dp[0][128] = 0;

		rep(i,N)
		{
			rep(j,256)
			{
				if(dp[i][j] == MAX){ continue; }	
				rep(k,M)
				{
					int yn = j + C[k];
					yn = round255(yn);
					int sum2 = (x[i] - yn)*(x[i] - yn);
					dp[i+1][yn] = min(dp[i+1][yn], dp[i][j]+sum2);
				}
			}
		}

		cout << *min_element(dp[N],dp[N]+256) << endl;
	}
	return 0;
}

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

int main() {
    int N, M;
    while (cin >> N >> M, N) {
        vector<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];
        const int INF = 1 << 30;
        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) {
            for (int k = 0; k < M; ++k) {
                int nj = max(0, min(255, j + C[k]));
                dp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + (nj - x[i]) * (nj - x[i]));
            }
        }
        int ans = INF;
        for (int i = 0; i < 256; ++i) {
            ans = min(ans, dp[N][i]);
        }
        cout << ans << endl;
    }
}

C++: 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
using namespace std;

const int INF = 987654321;

int main(void)
{
	for (;;)
	{
		int n, m;
		cin >> n >> m;
		if (!n)break;
		vector<int>c;
		for (int i = 0; i < m; ++i)
		{
			int cc; cin >> cc;
			c.push_back(cc);
		}
		array<int, 256>dp;
		fill(dp.begin(), dp.end(), INF);
		dp[128] = 0;
		for (int i = 1; i <= n; ++i)
		{
			array<int, 256>ndp;
			fill(ndp.begin(), ndp.end(), INF);
			int x;
			cin >> x;
			for (int val = 0; val < 256; ++val)
			{
				if (val == 0)
				{
					int gap = -1;
					for (int ck : c)gap = max(gap, -ck);
					for (int old = 0; old <= gap; ++old)
					{
						ndp[val] = min(ndp[val], dp[old] + (x - val) * (x - val));
					}
				}
				else if (val == 255)
				{
					int gap = 0;
					for (int ck : c)gap = max(gap, ck);
					for (int old = 255 - gap; old < 256; ++old)
					{
						ndp[val] = min(ndp[val], dp[old] + (x - val) * (x - val));
					}
				}
				else
				{
					for (int ck : c)
					{
						int old = val - ck;
						if (old < 0)old = 0;
						if (old >= 256)old = 255;
						ndp[val] = min(ndp[val], dp[old] + (x - val) * (x - val));
					}
				}
			}
			dp = ndp;
		}
		int ans = INF;
		for (int can : dp)
		{
			ans = min(ans, can);
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <climits>
#include <algorithm>
#define MAX_N 20000
#define MAX_M 16
#define MAX_X 256
#define INIT 128
using namespace std;

long long dp[MAX_N + 1][MAX_X];
int c[MAX_M];
int x[MAX_N + 1];
int n, m;

void solve() {
  dp[0][128] = 0;
  for (int i = 0; i + 1 <= n; i++) {
    for (int j = 0; j < MAX_X; j++) {
      if (dp[i][j] == LONG_MAX) continue;

      for (int k = 0; k < m; k++) {
	int t = j + c[k];
	if (t < 0) t = 0;
	if (t > 255) t = 255;
	int s = (t - x[i + 1]) * (t - x[i + 1]);
	dp[i + 1][t] = min(dp[i][j] + s, dp[i + 1][t]);
      }
    }
  }
  long long ans = LONG_MAX;
  for (int i = 0; i < MAX_X; i++)
    ans = min(ans, dp[n][i]);
  cout << ans << endl;
}

void init() {
  for (int i = 0; i < MAX_N; i++)
    for (int j = 0; j < MAX_X; j++)
      dp[i][j] = LONG_MAX;
}

int main() {
  while (true) {
    cin >> n >> m;
    if (n == 0 && m == 0) return 0;

    init();
    for (int i = 0; i < m; i++)
      cin >> c[i];
    for (int i = 1; i <= n; i++)
      cin >> x[i];

    solve();
  }
}