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 <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, m;
int c[160], x[200100];
int dp[200000][256+1];

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 160){
			REP(j, 2560){
				dp[i][j] = INF;
			}
		}
		REP(i, m){
			cin >> c[i];
		}
		REP(i, n){
			cin >> x[i];
		}
		dp[0][128] = 0;
		REP(i, n){
			REP(j, m){
				REP(k, 256){
					int num = k + c[j];
					if (num <= 0){
						num = 0;
					}
					if (num >= 255){
						num = 255;
					}
					dp[i + 1][num] = min(dp[i][k] + (x[i] - num)*(x[i] - num), dp[i + 1][num]);
				}
			}
		}
		int ans = INF;
		REP(i, 2560){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

C++: #include<bits/stdc++.h>
#define ll long long int

using namespace std;

const ll mod=1000000007;
const ll inf=1e18;

int main(){

  ll n,m;
  cin >> n>> m;

  vector<ll> ans={};

  while(n!=0 || m!=0){
    ll c[m],x[n];
    for(int i=0;i<m;i++)cin >> c[i];
    for(int j=0;j<n;j++)cin >> x[j];
  
    //y_{i+1}をjにしたときの最小
    ll dp[n][256];
    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++)dp[i][j]=inf;
    }

    ll y=128;
    for(int i=0;i<m;i++){
      if(y+c[i]>=255)dp[0][255]=(255-x[0])*(255-x[0]);
      else if(y+c[i]<=0)dp[0][0]=x[0]*x[0];
      else dp[0][y+c[i]]=(x[0]-y-c[i])*(x[0]-y-c[i]);
    }


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

    ll mi=10000000000;
    for(int i=0;i<256;i++)mi=min(mi,dp[n-1][i]);

    //cout << mi << endl;
    ans.push_back(mi);

    cin >> n >> m;
  }

  for(int i=0;i<ans.size();i++)cout << ans[i] <<endl;

}

C++: #include <iostream>
#include <vector>
 
using namespace std;
 
int main() {
 int n,m;
 while(cin >> n >> m, n) {
  vector<int> code(m), value(n);
  for (int i = 0; i < m; i++)
   cin >> code[i];
  for (int i = 0; i < n; i++)
   cin >> value[i];
  vector<vector<int> > dp(256, vector<int>(n + 1, 1000000000));
  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 val = min(255,max(0,j+code[k]));
     dp[i+1][val] = min(dp[i+1][val], dp[i][j] + (val -value[i]) * (val - value[i]));
    }
   }
  }
  int ans = 1000000000;
  for (int i = 0; i < 256; i++) {
   ans = min(ans, dp[n][val]);
  }
  cout << ans << endl;
 }
 return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;
using ll=long long;

ll dp[20][256];

ll dfs(int i,int y,vector<int>&c,vector<int>&x){
    if(i>=x.size())return 0;
    if(y<0)y=0;
    if(y>255)y=255;
    if(dp[i][y]!=-1)return dp[i][y];
    ll res=999999999999;
    for(int j=0;j<c.size();++j){
        res=min(res,dfs(i+1,y+c[j],c,x)+(y-x[i])*(y-x[i]));
    }
    return dp[i][y]=res;
}

int main(){
    int n,m;
    while(cin>>n>>m,n){
        for(int i=0;i<20;++i){
            for(int j=0;j<256;++j)dp[i][j]=-1;
        }
        vector<int>c(m),x(n+1);
        for(int i=0;i<m;++i){
            cin>>c[i];
        }
        x[0]=128;
        for(int i=1;i<n+1;++i){
            cin>>x[i];
        }
        cout<<dfs(0,128,c,x)<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;

int main() {
  while(1){
    int n,m;
    cin>>n>>m;
    if(!n)break;
    vector<int> codes(m);
    REP(i,m)cin>>codes[i];
    vector<int> data(n);
    REP(i,n)cin>>data[i];
    vector<int64_t> dp(256,0);
    REP(i,n){
      vector<int64_t> tmp(256,INT64_C(1000000000000000));
      REP(j,256){
        REP(k,m){
          int newv = min(255, max(0, j+codes[k]));
          int diff = data[i] - newv;
          int sqd = diff*diff;
          tmp[newv] = min(tmp[newv], dp[j] + sqd);
        }
      }
      dp.swap(tmp);
    }
    cout << *min_element(begin(dp),end(dp)) << endl;
  }
  return 0;
}