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 <vector>
#include <climits>
using namespace std;
typedef long INT;

int main( void )
{
	int n, m; // N: üÍM, M: R[hubNÌ·³
	while ( cin >> n >> m && n && m )
	{
		// üÍ
		vector <int> C(m);
		for ( int i = 0; i < m; i++ )
		{
			cin >> C[i];
		}
		vector <int> x(n+1);
		x[0] = 0;
		for ( int i = 0; i < n; i++ )
		{
			cin >> x[i+1];
		}

		// 3d[vµÄÝé
		vector <int> y(n+1);
		y[0] = 128;
		for ( int p = 1; p <= n; p++ )
		{
			int prev_x = x[p];
			INT good = INT_MAX;
			int good_i = 0;
			for ( int i = 0; i < m; i++ )
			{
				// left
				int prev_y = y[p-1] + C[i];
				for ( int j = 0; j < m; j++ )
				{
					// right
					int next_x = p<n ? x[p+1] : 0;
					int next_y = p<n ? prev_y + C[j] : 0;

					if ( next_y < 0 ) next_y = 0;
					if ( next_y > 255 ) next_y = 255;

					// for debugging
					// cout << prev_x << " " << prev_y << " - " << next_x << " " << next_y << endl;

					INT sum = (prev_x-prev_y)*(prev_x-prev_y) + (next_x-next_y)*(next_x-next_y);
					if ( sum < good )
					{
						good = sum;
						good_i = i;
					}
				}
			}
			// for debugging
			// cout << good << " " << good_i << endl;
			y[p] = y[p-1] + C[good_i];
			if ( y[p] < 0 ) y[p] = 0;
			if ( y[p] > 255 ) y[p] = 255;
		}

		INT answer = 0;
		for ( int p = 1; p <= n; p++ )
		{
			answer += (x[p]-y[p])*(x[p]-y[p]);
		}
		
		cout << answer << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REP(i,n) FOR(i,0,n)
typedef vector<int> vi;
typedef vector<vi> vii;

int main(){
	int n,m;
	while(cin>>n>>m,n&&m){
		vi c(m),x(n);
		REP(i,m){
			cin>>c[i];
		}
		REP(i,n){
			cin>>x[i];
		}

		vii dp(n+1,vi(256,INT_MAX));
		dp[0][128]=0;
		REP(i,n){
			REP(j,256){
				if(dp[i][j]==INT_MAX)continue;
				REP(k,m){
					int y=j+c[k];
					if(y<0)y=0;
					if(y>255)y=255;
					dp[i+1][y]=min(dp[i+1][y],dp[i][j]+(int)pow((double)y-x[i],2));
				}
			}
		}
		int ans=INT_MAX;
		REP(i,256){
			ans=min(ans,dp[n][i]);
		}
		cout<<ans<<endl;
	}
}

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

#define INF 1e9
#define llINF 1e18
#define MOD 1e9+7
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define sqr(x) (x)*(x)
using namespace std;
vector<int>C(5000);
vector<int>x(100000);
int ans=0;
int n,m;
int main(){
  while(cin>>n>>m,n){
    ans=INF;
    int dp[n+20][260]={};
    for(int i=0;i<n+2;i++)
      for(int j=0;j<260;j++)
	dp[i][j]=INF;
    for(int i=0;i<m;i++)
      cin>>C[i];
    for(int i=0;i<n;i++){
      cin>>x[i];
    }

    dp[0][128]=0;
    for(int i=1;i<=n;i++){
      for(int j=0;j<260;j++){
	if(dp[i-1][j]!=INF){
	  for(int k=0;k<m;k++){
	    int num=j+C[k];
	    if(num>=255)num=255;
	    else if(num<0)num=0;
	    //cout<<i<<" "<<
	    dp[i][num]=min(dp[i-1][j]+((num-x[i-1])*(num-x[i-1])),dp[i][num]);
	  }
	}
      }
    }
    for(int i=0;i<260;i++){
      ans=min(dp[n][i],ans);
    }
    cout<<ans<<endl;
  }
  return 0;
}

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

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<" "; cout<<endl; }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
inline int sq(int n){
  return n * n;
}

int dp[20001][256];
int main(){
  int N, M;
  while(cin>>N>>M && N){
    vector<int> code(M);
    REP(i,M)cin>>code[i];
    vector<int> X(N);
    REP(i,N)cin>>X[i];
    REP(i,20001)fill(dp[i], dp[i] + 256, INF);
    dp[0][128] = 0;
    REP(i,N)REP(j,256)if(dp[i][j]!=INF){
      int t = dp[i][j];
      REP(k, M){
        int Y = j + code[k];
        if(Y > 255) Y = 255;
        if(Y < 0) Y = 0;
        dp[i+1][Y] = min(dp[i+1][Y], t + sq(X[i] - Y));
      }
    }
    int ans = INF;
    REP(j, 256) ans = min(ans, dp[N][j]);
    cout<<ans<<endl;
  }
  return 0;
}