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 <iostream>
#include <cstdio>

using namespace std;

long long dp[20010][256];
int book[20];
int input[20010];
int N, M;

static const long long MAX = 10000000000;

void init() {
  fill(&dp[0][0], &dp[20009][256], MAX);
}

void solve() {
  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++) {
        int tar = j + book[k];
        if (tar < 0) {
          tar = 0;
        } else if (tar > 255) {
          tar = 255;
        }
        long long sub = tar - input[i];
        sub *= sub;
        dp[i + 1][tar] = min(dp[i + 1][tar], dp[i][j] + sub);
      }
    }
  }

  long long mn = MAX;
  for (int i = 0; i < 256; i++) {
    mn = min(mn, dp[N][i]);
  }
  printf("%ld\n", mn);
}

int main() {
    while (true) {
      scanf("%d %d ", &N, &M);
      if (N == 0 && M == 0) {
        break;
      }
      init();
      for (int i = 0; i < M; i++) {
        scanf("%d ", &book[i]);
      }
      for (int i = 0; i < N; i++) {
        scanf("%d ", &input[i]);
      }
      solve();
    }
}

C++: #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N, M;
  while(cin>>N>>M,N||M) {
    int c[M]; FOR(i,0,M) cin >> c[i];
    int x[N]; FOR(i,0,N) cin >> x[i];
    ll dp[N+1][256]; FOR(i,0,N+1) FOR(j,0,256) dp[i][j] = 1e15;
    dp[0][128] = 0;
    FOR(i,0,N) {
      FOR(j,0,256) {
        if(dp[i][j] == 1e15) continue;
        FOR(k,0,M) {
          int y = max(0, min(255, j + c[k]));
          dp[i+1][y] = min(dp[i+1][y], dp[i][j] + (ll)(x[i]-y) * (x[i]-y));
        }
      }
    }
    ll ans = 1e15;
    FOR(i,0,256) ans = min(ans, dp[N][i]);
    cout << ans << endl;
  }
  return 0;
}

C++: // C++11
#include "bits/stdc++.h"
#include <sys/time.h>
#include <emmintrin.h>
#include <string>
#include <sstream>
#include <fstream>
#include <random>
#include <bitset>

using namespace std;

inline long long GetTSC() {
  long long lo, hi;
  asm volatile ("rdtsc": "=a"(lo), "=d"(hi));
  return lo + (hi << 32);
}
inline double GetSeconds() {
  return GetTSC() / 2.8e9;
}

const int M = 256;
const int XM = 20000;
const int CM = 16;
const long inf = pow(10,15);
long d[M];
long nd[M];
int xs[XM];
int cs[CM];

void solve(){
  double starttime = GetSeconds();
  while(1){
    int n,m;
    cin >> n >> m;
    if(n==0 && m==0) break;
    for(int i=0; i<m; i++){
      cin >> cs[i];
    }
    for(int i=0; i<n; i++){
      cin >> xs[i];
    }

    for(int i=0; i<M; i++){
      d[i] = inf;
    }
    d[128] = 0;
    for(int i=0; i<n; i++){
      int x = xs[i];
      for(int j=0; j<M; j++){
        nd[j] = inf;
      }
      for(int k=0; k<256; k++){
        long v = d[k];
        for(int j=0; j<m; j++){
          int c = cs[j];
          int nk = max(min(k+c,255),0);
          if(nd[nk] > v + pow(x-nk, 2)){
            nd[nk] = v + pow(x-nk, 2);
          }
        }
      }
      for(int j=0; j<M; j++){
        d[j] = nd[j];
      }
    }
    long t = inf;
    for(int j=0; j<M; j++){
      t = min(t, d[j]);
    }

    cout << t << endl;
  }

  return;
}

int main() {
  solve();
  return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
using ll=long long;
#define print(n) cout<<n<<endl
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<ll,ll>
#define vl vector<ll>
#define vi vector<int>
#define vvl vector<vector<ll>>
#define vvi vector<vector<int>>
const int M=100111;
const int inf=1000000007;
const long long INF=1e18;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
int ddx[8]={1,-1,0,0,1,-1,-1,1},ddy[8]={0,0,1,-1,1,-1,1,-1};

int main(){
	while(1){
		int n,m,c[20],x;
		cin>>n>>m;
		if(n==0&&m==0)break;
		rep(i,0,m)cin>>c[i];
		ll dp[20020][256];//dp[i][j]: n=iの時にyi=jを選んだ最小値.
		rep(i,0,20020)rep(j,0,256)dp[i][j]=INF;
		dp[0][128]=0;
		rep(i,0,n){
			cin>>x;
			rep(j,0,256){
				rep(k,0,m){
					int y=min(255,max(0,j+c[k]));
					dp[i+1][y]=min(dp[i+1][y],dp[i][j]+(y-x)*(y-x));
				}
			}
		}
		ll ans=INF;
		rep(i,0,256)ans=min(ans,dp[n][i]);
		print(ans);
	}

}