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 LL long long
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VL vector<LL>
#define VVL vector<vector<LL>>
#define VVVL vector<vector<vector<LL>>>
#define VB vector<bool>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EPS 1e-14

template<class T> T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> void print(T x) { std::cout << x << std::endl; }

const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy = { 0, -1, 0, 1 }, dx = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）

using namespace std;

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

    while (true) {
        int N, M;
        cin >> N >> M;
        if (N == 0 and M == 0) { break; }

        vector<int> C(M), X(N + 1);
        X[0] = 128;
        FOR(i, 0, M) {
            cin >> C[i];
        }
        FOR(i, 0, N) {
            cin >> X[i + 1];
        }

        VVL dp(N + 2, VL(256, LONG_LONG_MAX));
        dp[0][128] = 0;

        FOR(i, 0, X.size() - 1) {
            int x = X[i + 1];

            FOR(j, 0, dp[0].size()) {
                if (dp[i][j] == LONG_LONG_MAX) { continue; }
                FOE(c, C) {
                    int v = min(max(0, j + c), 255);
                    dp[i + 1][v] = min(dp[i + 1][v], dp[i][j] + (x - v) * (x - v));
                }
            }
        }
        LL ans = LLONG_MAX;
        FOR(j, 0, dp[0].size()) {
            ans = min(ans, dp[N][j]);
        }
        print(ans);
    }
    return 0;
}

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

int main() {
  int n, m;
  while (cin >> n >> m, n) {
    vector<int> cs(m), x(n);
    for (int i = 0; i < m; i++) cin >> cs[i];
    for (int i = 0; i < n; i++) cin >> x[i];
    vector<vector<ll>> dp(n + 1, vector<ll>(256, 1e15));
    dp[0][128] = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < 256; j++) {
        for (auto c : cs) {
          int v = min(255, max(0, j + c));
          dp[i + 1][v] = min(dp[i + 1][v], dp[i][j] + (x[i] - v) * (x[i] - v));
        }
      }
    }
    ll ans = *min_element(begin(dp[n]), end(dp[n]));
    cout << ans << endl;
  }
}

C++: #include <iostream>

using namespace std;

inline int normalize(int y) {
    return min(255, max(0, y));
}

inline int get_error(int y, int y0) {
    y -= y0;
    return y * y;
}

int errors[20001][256];
int solve(int n, int m, int c[], int x[]) {
    int min_error = -1;
    for (int t = 0; t <= n; ++t) {
        for (int y = 0; y < 256; ++y) {
            errors[t][y] = -1;
        }
    }
    errors[0][128] = 0;
    for (int t = 0; t < n; ++t) {
        for (int y = 0; y < 256; ++y) {
            if (errors[t][y] < 0) {
                continue;
            }
            for (int i = 0; i < m; ++i) {
                int yn = normalize(y + c[i]);
                int e = errors[t][y] + get_error(yn, x[t]);
                if (errors[t + 1][yn] < 0 || e < errors[t + 1][yn]) {
                    errors[t + 1][yn] = e;
                }
            }
        }
    }
    for (int y = 0; y < 256; ++y) {
        if (errors[n][y] < 0) {
            continue;
        }
        if (min_error < 0 || errors[n][y] < min_error) {
            min_error = errors[n][y];
        }
    }
    return min_error;
}

int main() {
    int n, m;
    int c[16], x[20000];
    while (true) {
        cin >> n >> m;
        if (n == 0) {
            return 0;
        }
        for (int i = 0; i < m; ++i) {
            cin >> c[i];
        }
        for (int i = 0; i < n; ++i) {
            cin >> x[i];
        }
        cout << solve(n, m, c, x) << endl;
    }
}

C++: #include<iostream>
#include<algorithm>
#define NUM 256
using namespace std;

int dp[20001][NUM];

int main(){
  int n,m;
  while(cin>>n>>m,n){
    for(int i=0;i<=n;i++)
      for(int j=0;j<NUM;j++)
	dp[i][j]=1<<30;
    dp[0][128]=0;
    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];
    for(int i=0;i<n;i++){
      for(int j=0;j<NUM;j++){
	for(int k=0;k<m;k++){
	  if(j+c[k]<=0){
	    dp[i+1][0]=min(dp[i+1][0],dp[i][j] + x[i]*x[i]);
	  }else if(j+c[k]>=255){
	    dp[i+1][255]=min(dp[i+1][255],dp[i][j] + (x[i]-255)*(x[i]-255));
	  }else{
	    dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j] + (x[i]-j-c[k])*(x[i]-j-c[k]));
	  }
	}
      }
    }
    // for(int j=0;j<256;j++){
    //   for(int i=0;i<n;i++){
    // 	cout << dp[i][j] << " ";
    //   }
    //   cout << endl;
    // }

    int res=1<<30;
    for(int i=0;i<NUM;i++)res=min(res,dp[n][i]);
    cout << res << endl;
  }
  return 0;
}