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;

const long long INF = (1LL << 60);

int main(){

  while(true){
    int N, M;
    cin >> N >> M;

    if(N == 0){
      break;
    }

    vector<int> C(M);
    for(int i = 0; i < M; i++){
      cin >> C[i];
    }

    vector<int> x(N);
    for(int i = 0; i < N; i++){
      cin >> x[i];
    }

    vector<vector<long long>> minCost(N + 1, vector<long long>(256, INF));
    minCost[0][128] = 0;
    for(int i = 0; i < N; i++){
      for(int j = 0; j < 256; j++){
	long long cost = minCost[i][j];
	if(cost == INF){
	  continue;
	}
	for(int k = 0; k < M; k++){
	  int nextState = j + C[k];
	  nextState = min(nextState, 255);
	  nextState = max(nextState, 0);
	  int diff = nextState - x[i];
	  long long nextCost = cost + diff * diff;
	  	  
	  minCost[i + 1][nextState] = min(minCost[i + 1][nextState], nextCost);
	}
      }
    }

    long long ans = INF;
    for(int i = 0; i < 256; i++){
      ans = min(ans, minCost[N][i]);
    }

    cout << ans << endl;
  }
  
  return 0;
}

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

using ll = long long;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
// #define INF 1e9
const ll INF = 1LL << 60;
ll square(ll x){
  return x * x;
}
ll dp[20005][300];

int main(){
  while(true){
    int N, M;
    cin >> N >> M;
    if(N == 0 && M == 0) break;
    vector<int> C(M), x(N);
    REP(i, M){
      cin >> C[i];
    }
    REP(i, N){
      cin >> x[i];
    }
    REP(i, 20005){
      REP(j, 258){
        dp[i][j] = INF;
      }
    }
    dp[0][128] = 0;
    REP(i, N){
      REP(j, 256){
        if(dp[i][j] == INF) continue;
        REP(k, M){
          int nx = max(0, min(255, j+C[k]));
          dp[i+1][nx] = min(dp[i+1][nx], dp[i][j] + square(x[i]-nx));
        }
      }
    }
    ll ans = INF;
    REP(i, 256){
      ans = min(ans, dp[N][i]);
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#define N 20001
#define M 256
#define INF 1000000000

using namespace std;

int n, m;
int c[16];
int dp[N][M];

void init(){
  for(int i=0; i<N; ++i){
    for(int j=0; j<M; ++j){
      dp[i][j] = INF;
    }
  }
  dp[0][128] = 0;
}

int code(int k){
  if(k < 0) return 0;
  if(k >= M) return M-1;
  return k;
}

void solve(int& x, int& u, int& v){
  for(int i=0; i<m; ++i){
    int j = code(v + c[i]);
    dp[u][j] = min(dp[u][j], (x-j)*(x-j) + dp[u-1][v]);
  }
}

int main(){
  int x;
  while(1){
    cin >> n >> m;
    if(!n && !m) break;
    init();
    for(int i=0; i<m; ++i) cin >> c[i];
    for(int i=1; i<=n; ++i){
      cin >> x;
      for(int j=0; j<M; ++j){
	if(dp[i-1][j] != INF) solve(x, i, j);
      }
    }
    int ans=INF;
    for(int j=0; j<M; ++j) ans = min(ans, dp[n][j]);
    cout << ans << endl;
  }
  return 0;
}

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

using namespace std;

typedef long long ll;
typedef ll li;
typedef pair<int,int> PI;
#define EPS (1e-10L)
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(),a.end()
#define FOR(it,a) for(__typeof(a.begin())it=a.begin();it!=a.end();++it)
void pkuassert(bool t){t=1/t;};
int dx[]={0,1,0,-1,1,1,-1,-1};
int dy[]={1,0,-1,0,-1,1,1,-1};

int n,m;
int c[16];


bool vis[256][20001];

void solve(){
  rep(i,m) cin >> c[i];
  int x[n];
  rep(i,n) cin >> x[i];
  priority_queue<pair<int,PI> > q;
  q.push(mp(0,mp(0,128)));
  memset(vis,0,sizeof(vis));
  while(!q.empty()){
    int cc=-q.top().F;
    int ne=q.top().S.F;
    int cv=q.top().S.S;
    q.pop();
    if(ne==n){
      cout << cc << endl;
      return;
    }
    
    if(vis[cv][ne]) continue;
    vis[cv][ne]=true;
    rep(j,m){
      ll nv=cv+c[j];
      nv=max(nv,0LL);
      nv=min(nv,255LL);
      if(vis[ne+1][nv]) continue;
      q.push(mp(-cc-(nv-x[ne])*(nv-x[ne]),mp(ne+1,nv)));
    }
  }
}

int main(int argc, char *argv[])
{
  while(cin >> n >> m && n) solve();
  return 0;
}