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 <set>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1 << 22;
const int MAX_N = 21000;
const int MAX_M = 20;
int table[MAX_N+1][256];
int x[MAX_N];
int book[MAX_M];
void db_print(int line[]){
  for(int i = 100; i < 200; ++i){
    cout << i << "[" << line[i] << "]" << endl;
  }
  cout << endl;
}
int main(){
  int N, M;
  while(true){
    cin >> N >> M;
    if((N|M) == 0){
      break;
    }
    for(int i = 0; i < M; ++i){
      cin >> book[i];
    }
    for(int i = 0; i < N; ++i){
      cin >> x[i];
    }
    fill_n((int *) table, (N+1) * 256, INF);
    table[0][128] = 0;
    for(int i = 0; i < N; ++i){
      //db_print(table[i]);
      for(int j = 0; j < 256; ++j){
	for(int b = 0; b < M; ++b){	  
	  int d = book[b];
	  if(0 <= j+d && j+d <= 255){
	    int t = (x[i] - (j+d)) * (x[i] - (j+d));
	    table[i+1][j+d] = min(table[i+1][j+d], table[i][j]+t);
	  }
	  if(j+d < 0){
	    int t = (x[i] - 0) * (x[i] - 0);
	    table[i+1][0] = min(table[i+1][0], table[i][j]+t);
	  }
	  if(j+d > 255){
	    int t = (x[i] - 255) * (x[i] - 255);
	    table[i+1][255] = min(table[i+1][255], table[i][j]+t);
	  }
	}
      }
    }
    //db_print(table[N]);
    int ans = INF;
    for(int i = 0; i < 256; ++i){
      ans = min(ans, table[N][i]);
    }
    cout << ans << endl;
  }    
  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int main(){
	int N,M;
	const int INF=(1<<28);
	while(cin >> N >> M, (N|M)){
		int c[M];
		for(int i=0; i<M; ++i)	cin >> c[i];
		vector<vector<int> > dp(N+1, vector<int>(256, INF));
		dp[0][128]=0;
		int x;
		for(int i=0; i<N; ++i){
			cin >> x;
			for(int j=0; j<=255; ++j)for(int k=0; k<M; ++k){
				int next=max(0,min(255, j+c[k]));
				dp[i+1][next]=min(dp[i+1][next], dp[i][j]+((x-next)*(x-next)));
			}
		}
		int ans=INF;
		for(int i=0; i<=255; ++i)	ans=min(ans, dp[N][i]);
		cout << ans << endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

typedef struct{
  int minv;
  int prevv;
}Pair;

int main(){
  int n,m;
  Pair pair={1<<30,0};
    while(cin>>n>>m,n+m){
    vector<int> cn(m);
    vector<int> xn(n);
    for(int i=0;i<m;i++) cin>>cn[i];
    for(int i=0;i<n;i++) cin>>xn[i];
    vector<vector<Pair> > dp(n+1,vector<Pair>(m,pair));
    for(int i=0;i<m;i++){
      dp[0][i].prevv=128;
      dp[0][i].minv=0;
    }
    for(int i=0;i<n;i++){
      for(int j=0;j<m;j++){
	Pair p=dp[i][j];
	for(int k=0;k<m;k++){
	  int calc=p.prevv+cn[k];
	  if(calc < 0) calc = 0;
	  if(calc > 255) calc= 255;
	  int t=(xn[i]-calc)*(xn[i]-calc)+p.minv;
	  if(t < dp[i+1][k].minv){
	    dp[i+1][k].minv=t;
	    dp[i+1][k].prevv=calc;
	  }
	}
      }
    }
    int _min=1<<30;
    for(int i=0;i<m;i++){
      _min=min(_min,dp[n][i].minv);
    }
    cout<<_min<<endl;
  }

  return 0;
}

C++: #include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

const int INF = (int)10e9;

int main(){
  int n, m;
  while(scanf("%d%d", &n, &m) && (n|m)){
    vector<int> C(m);
    for(int i=0; i<m; i++) scanf("%d", &C[i]);
    
    vector<int> dp(256, INF);
    dp[128] = 0;
    while(n--) {
      vector<int> next(256, INF);
      int in; scanf("%d", &in);
      for(int i=0; i<256; i++){
	if(dp[i] == INF) continue;
	for(int j=0; j<m; j++){
	  int conv = i + C[j];
	  conv = min(max(conv, 0), 255);
	  int diff = (in - conv) * (in - conv);
	  next[conv] = min(next[conv], dp[i] + diff);
	}
      }
      dp = next;
    }
    
    printf("%d\n", *min_element(dp.begin(), dp.end()));
  }
  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int N,M;
int C[20];
int X[20004];
const long long INF = 1000000000000;
long long dp[20004][260];
long long dfs(int i_,int y_) {
    if(i_ == N) return dp[i_][y_] = 0;
    if(dp[i_][y_]!=INF) return dp[i_][y_];

    long long ret = INF;

    rep(i,M) {
        int y = y_ + C[i];
        y = max(y,0);
        y = min(y,255);
        //cout<<y<<","<<X[i_]<<endl;
        ret = min(ret,dfs(i_+1,y)+(X[i_]-y)*(X[i_]-y));

    }
    //cout<<i_<<","<<y_<<","<<ret<<endl;
    return dp[i_][y_] = ret;

}
void solve() {
    rep(i,20004) rep(j,260) dp[i][j] = INF;
    rep(i,M) cin>>C[i];
    rep(i,N) cin>>X[i];
    long long ans = INF;
    ans = min(ans,dfs(0,128));
    rep(j,260) {
        ans = min(ans,dp[0][j]);
    }
    cout<<ans<<endl;
    rep(i,M) C[i] = 0;
    rep(i,N) X[i] = 0;

}
int main() {
    while(cin>>N>>M) {
        if(N+M==0) return 0;
        solve();
    }

    return 0;
}

C++: #include <iostream>
#include <climits>
#include <algorithm>
using namespace std;

int main(){
	int C[16];
	int n,m;
	while(cin >> n >> m && n){
		for(int i = 0 ; i < m ; i++) cin >> C[i];
		int dp[2][256];
		for(int i = 0 ; i < 2 ; i++)
			for(int j = 0 ; j < 256 ; j++)
				dp[i][j] = INT_MAX;
		dp[0][128] = 0;
		
		for(int j = 1 ; j <= n ; j++){
			int x; cin >> x;
			for(int i = 0 ; i < 256 ; i++) dp[j&1][i] = INT_MAX;
			for(int i = 0 ; i < 256 ; i++){
				for(int k = 0 ; k < m ; k++){
					int y = i + C[k];
					y = min(y,255); y = max(0,y);
					dp[j&1][y] = min(dp[j&1][y],dp[j&1^1][i] + (y-x)*(y-x) );
				}
			}
		}
		cout << *min_element(dp[n&1],dp[n&1]+256) << endl;
	}
}