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

using namespace std;

const long long inf=1LL<<60;
long long memo[256],memo2[256];

int main()
{
	for(int n,m;scanf("%d%d",&n,&m),n;){
		int c[16];
		static int x[20001];
		for(int i=0;i<m;i++)	scanf("%d",c+i);
		for(int i=0;i<n;i++)	scanf("%d",x+i);

		for(int j=0;j<256;j++)	memo[j]=memo2[j]=inf;

		memo[128]=0;
		for(int i=0;i<n;i++){
			for(int j=0;j<256;j++){
				if(memo[j]==inf)	continue;
				for(int k=0;k<m;k++){
					int next=min(255,max(0,j+c[k]));
					memo2[next]=min(memo2[next],memo[j]+(next-x[i])*(next-x[i]));
				}
			}
			for(int j=0;j<256;j++)	memo[j]=memo2[j],memo2[j]=inf;
		}

		long long emin=inf;
		for(int j=0;j<256;j++)	emin=min(emin,memo[j]);
		printf("%lld\n",emin);
	}

	return 0;
}

C++: #include<iostream>
using namespace std;
const int inf=1e8;

void hoge(int N, int M){

   int c[M];
   for(int i=0; i<M; i++) cin>> c[i];
   int x[N];
   for(int i=0; i<N; i++) cin>> x[i];
   int memo[N+1][256];
   for(int i=0; i<N+1; i++){
      for(int j=0; j<256; j++){
         memo[i][j]=inf;
      }
   }

   memo[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 p=max(0, min(255, j+c[k]));
            memo[i+1][p]=min(memo[i][j]+(p-x[i])*(p-x[i]), memo[i+1][p]);
         }
      }
   }
   int mi=1e8;
   for(int j=0; j<256; j++) mi=min(mi, memo[N][j]);
   cout<< mi<< endl;

}


int main(){

   while(1){
      int N, M;
      cin>> N>> M;
      if(!(N||M)) break;
      hoge(N, M);
   }
   return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <algorithm>
#include <assert.h>
using namespace std;
typedef long long ll;

#define REP(j,n) for (int (j)=0; j<(int)(n); ++j)
#define FOR(j,k,n) for (int (j)=(k); j<(int)(n); ++j)
#define FOREQ(j,k,n) for (int (j)=(k); j<=(int)(n); ++j)

#define MEMSET(z,val) memset(z,val,sizeof(z))

int n, m;
int x[30000];
int c[100];
int memo[30000][300];

inline ll square(ll x) { return x * x; }

ll calc(int depth, int color) {
    assert(0 <= color && color <= 255);
    if (memo[depth][color] != -1) { return memo[depth][color]; }
    if (depth == n) { return memo[depth][color] = 0; }
    ll ret = 1LL << 60;
    REP(i, m) {
        int ncolor = color + c[i];
        ncolor = max(0, min(255, ncolor));
        int cost = square(abs(x[depth + 1] - ncolor));
        ret = min(ret, calc(depth + 1, ncolor) + cost);
    }
    return memo[depth][color] = ret;
}

int main() {
    while (scanf("%d %d", &n, &m), n|m) {
        MEMSET(memo, -1);
        REP(i, m) {
            scanf("%d", &c[i]);
        }
        REP(i, n) {
            scanf("%d", &x[i + 1]);
        }
        printf("%lld\n", calc(0, 128));
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<ll(n);++i)
#define FOR(i,a,b) for(ll i=(a);i<ll(b);++i)

int main(){
  ll n,m;
  ll inf = ll(1)<<50;
  while(cin>>n>>m,n){
    vector<ll> c(m);
    rep(i,m) cin>>c[i];
    vector<ll> x(n);
    rep(i,n) cin>>x[i];

    vector<vector<ll>> dp(n+1,vector<ll>(256,inf));
    dp[0][128] = 0;

    rep(i,n){
      rep(j,256){
	rep(k,m){
	  ll nj = j + c[k];
	  if(nj < 0) nj = 0;
	  else if(255 < nj) nj = 255;
	  dp[i+1][nj] = min(dp[i+1][nj], dp[i][j]+(x[i]-nj)*(x[i]-nj));
	}
      }
    }

    ll ans = inf;
    rep(j,256) ans = min(ans, dp[n][j]);
    cout << ans << endl;
  }
}

C++: #include <iostream>
#include <algorithm>
#define inf 1e9

using namespace std;

int n, m;
int c[20], x[20005];
int dp[20005][300];

int main(void)
{
  while(cin >> n >> m, n&&m){
    for(int i = 1; i <= m; i++) cin >> c[i];
    for(int i = 1; i <= n; i++) cin >> x[i];

    for(int i = 0; i <= n; i++){
      for(int j = 0; j < 256; j++){
        dp[i][j] = inf;
      }
    }
    dp[0][128] = 0;

    for(int i = 0; i < n; i++){
      for(int j = 0; j < 256; j++){
        for(int k = 1; k <= m; k++){
          int nj = j + c[k];
          nj = min(nj, 255), nj = max(0, nj);
          dp[i+1][nj] = min(dp[i+1][nj], dp[i][j] + (x[i+1]-nj)*(x[i+1]-nj));
        }
      }
    }

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