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++: /*
 * aoj/2199_2nd/main.cpp
 */

// C++ 14
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring> // memset
#include <cassert>

using namespace std;

#define ll long long

#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template <class T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }

const ll INF = 100000000000000000;
const int MAX_N = 20100;
const int MAX_X = 256;
ll N, M;
vector<ll> C, X;
ll dp[MAX_N][MAX_X];

bool input() {
  cin >> N >> M;
  if (N + M==0) return false;
  ll a;
  C.clear(); X.clear();
  loop(n,0,M) {
    cin >> a;
    C.push_back(a);
  }
  loop(n,0,N) {
    cin >> a;
    X.push_back(a);
  }
  return true;
}

ll rec(int n = 0, int y_1 = 128) {
  ll &cache = dp[n][y_1];
  if (~cache) return cache;
  if (n == N) return cache = 0;
  int x = X[n];
  ll min_ = INF;
  for (auto &&c: C) {
    int y = min(255LL, max(0LL, y_1 + c));
    chmin(min_, (x-y)*(x-y) + rec(n+1, y));
  }
  return cache = min_;
}

ll memo() {
  memset(dp, -1, sizeof(dp));
  return rec();
}

ll give() {
  loop(n,0,N+1) loop(x,0,MAX_X) dp[n][x] = INF;

  for (int n=0; n<N; n++) {
    int x = X[n];
    if (n == 0) {
      for (auto &&c: C) {
        int y = min(255LL, max(0LL, 128 + c));
        dp[n][y] = (x-y)*(x-y);
      }
      continue;
    }

    for (int y_1=0; y_1<=255; y_1++) {
      for (auto &&c: C) {
        int y = min(255LL, max(0LL, y_1 + c));
        chmin(dp[n][y], (x-y)*(x-y) + dp[n-1][y_1]);
      }
    }
  }

  ll min_ = INF;
  loop(x,0,MAX_X) chmin(min_, dp[N-1][x]);
  return min_;
}

void solve() {
  cout << give() << endl;
}

int main() {
  // cout.precision(15);
  while (input()) solve();
  return 0;
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int sqr(int x) { return x*x; }

int main()
{
  int N, M;
  while (scanf("%d %d", &N, &M) != EOF && N != 0) {
    vector<int> cs(M);
    for (int i = 0; i < M; i++) {
      scanf("%d", &cs[i]);
    }

    static long long dp[20000+1][256];
    static const long long INF = 1LL<<50;
    fill_n(dp[0], 256, INF);
    dp[0][128] = 0;
    for (int i = 1; i <= N; i++) {
      int x;
      scanf("%d", &x);
      fill_n(dp[i], 256, INF);
      for (int j = 0; j < 256; j++) {
        for (int k = 0; k < M; k++) {
          int y = j + cs[k];
          if (y < 0) {
            y = 0;
          } else if (y > 255) {
            y = 255;
          }
          dp[i][y] = min(dp[i][y], dp[i-1][j] + sqr(y - x));
        }
      }
    }
    printf("%lld\n", *min_element(dp[N], dp[N]+256));
  }
  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 1000000007
#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[100], x[20010];
int dp[20][300];

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

const int INF = 1e+8;
const int MAX_M = 16;
const int MAX_N = 20001;

// dp[i][y] := i 番目までの差分の総和
int dp[MAX_N][256];

int main(){
	int N, M;
	while( cin >> N >> M, N || M ){
		int C[MAX_M] = {0};
		
		for(int i=0 ; i < M ; i++ ){
			cin >> C[i];
		}
		
		// 初期化
		for(int i=0 ; i <= MAX_N ; i++ ){
			for(int j=0 ; j < 256 ; j++ ){
				dp[i][j] = INF;
			}
		}
		dp[0][128] = 0;
		
		for(int i=1 ; i <= N ; i++ ){
			int x;
			cin >> x;
			for(int prev=0 ; prev < 256 ; prev++ ){
				for(int m=0 ; m < M ; m++ ){
					int next = prev + C[m];
					if( next < 0 ) next = 0;
					if( next > 255 ) next = 255;
					int diff = (next - x) * (next - x);
					dp[i][next] = min( dp[i][next] , dp[i-1][prev] + diff );
				}
			}
		}
		int ans = INF;
		for(int i=0 ; i < 256 ; i++ ){
			ans = min( ans , dp[N][i] );
		}
		cout << ans << endl;
	}
}