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(void){
	int n, m;
	while(1){
		cin >> n >> m;
		if(!n&&!m) break;
		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];
		}
		vector<vector <int>> dp(n+2);
		for(int i = 0; i < n+2; ++i){
			dp[i].resize(256);
			for(int j = 0; j < 256; ++j){
				dp[i][j] = INT_MAX;
			}
		}
		dp[0][128]=0;
		for(int i = 1; i <= n; ++i){
			for(int j = 0; j < m; ++j){
				for(int k = 0; k < 256; ++k){
					if(dp[i-1][k]==INT_MAX) continue;
					int next = k+c[j];
					if(next > 255) next = 255;
					if(next < 0) next = 0;
					dp[i][next] = min(dp[i][next], dp[i-1][k] + (int)pow(x[i-1]-next,2));
				}
			}
		}
		int ans = INT_MAX;
		for(int i = 0; i < 256; ++i){
			ans = min(ans, dp[n][i]);
			//cout << dp[n][i] << " ";
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>

using namespace std;
typedef long long ll;

ll c[16], x[20000];

ll dp[20001][256];

int main() {
	while (1) {
		int n, m;
		cin >> n >> m;
		if (n + m == 0)break;
		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 < 21; i++)for (int j = 0; j < 256; j++)dp[i][j] = 1e18;
		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 nxt = 0;
					nxt = j + c[k];
					if (nxt < 0)nxt = 0;
					if (nxt > 255)nxt = 255;
					
					dp[i + 1][nxt] = min(dp[i + 1][nxt], dp[i][j] + (x[i] - nxt) * (x[i] - nxt));
				}
			}
		}
		ll ans = 1e18;

		for (int i = 0; i < 256; i++) {
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;

	}

	return 0;
}

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

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX/3
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cout<<#x<<":"<<x<<endl
#define debug2(x,y) cout<<#x<<","<<#y":"<<x<<","<<y<<endl
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define MAXN 20000

ll dp[MAXN+10][256+10];

int add(int y,int diff){
    int ny = y+diff;
    if(ny<0) ny=0;
    if(ny>255) ny=255;
    return ny;
}

void solve(int N,int M){
    vector<int> c(M),x(N);
    rep(i,M) cin>>c[i];
    rep(i,N) cin>>x[i];

    rep(i,MAXN+10) rep(j,256) dp[i][j]=LINF;

    dp[0][128]=0;

    for(int i=0;i<N;i++){
        for(int j=0;j<256;j++){
            for(int k=0;k<M;k++){       // c[k]????????¨
                ll nx = add(j,c[k]);
                ll dif = x[i] - nx;
                dp[i+1][add(j,c[k])] = min(dp[i+1][add(j,c[k])],dp[i][j]+dif*dif);
            }
        }
    }

    ll ans = LINF;
    for(int i=0;i<256;i++){
        ans = min(ans,dp[N][i]);
    }



//    for(int i=0;i<256;i++){
//        cout << dp[N][i] << endl;
//    }

    cout << ans << endl;
}

int main(){
    int n,m;
    while(cin>>n>>m){
        if(n==0 and m==0) break;
        solve(n,m);
    }
}