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 <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll inf =1LL << 62;


int main(void){
	pii dp[2][16];
	int tar[20000];
	int d[16];
	int n,m;
	pii INF;
	INF.first=1 << 29;INF.second=1 << 29;
	while(cin >> n >> m,n|m){
		rep(i,m)
			cin >> d[i];
		rep(i,n)
			cin >> tar[i];
		pii init;
		init.first=128;init.second=0;
		rep(i,m){
			dp[0][i]=init;
			dp[1][i]=INF;
		}
		rep(i,n){
			rep(j,m)rep(k,m){
				pii tmp=dp[0][j];
				tmp.first+=d[k];
				tmp.first=max(tmp.first,0);
				tmp.first=min(tmp.first,255);
		//		cout << tmp.first << endl;
				tmp.second+=(tmp.first-tar[i])*(tmp.first-tar[i]);
				if(tmp.second<dp[1][k].second)
					dp[1][k]=tmp;
				else if(tmp.second==dp[1][k].second&&abs(tmp.first-tar[i+1])<abs(dp[1][k].first-tar[i+1]))
					dp[1][k]=tmp;
			}
			rep(j,m){
				dp[0][j]=dp[1][j];
				dp[1][j]=INF;
			}
		}
		int ans= 1 << 29;
		rep(i,m)
			ans=min(ans,dp[0][i].second);
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define MEMSET(v, h) memset((v), h, sizeof(v))
#define sqr(x) ((x) * (x))
#define bit(n) (1LL<<(n))
#define pcnt(x) __builtin_popcountll(x)
#define PB push_back
#define MP make_pair
#define endl "\n"
using Edge = pair<int,int>;
using Graph = vector<vector<Edge>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int dp[20100][256];
const int MAX = 1001001001;

int main() {
  while(1){
    int n,m; cin >> n >> m;
    if(n==0 && m==0) break;

    FOR(i,0,n){
      FOR(j,0,255){
        dp[i][j] = MAX;
      }
    }

    int c[m],x[n];
    FOR(i,0,m-1) cin >> c[i];
    FOR(i,0,n-1) cin >> x[i];
    dp[0][128] = 0;

    FOR(i,0,n-1){
      FOR(j,0,255){
        if(dp[i][j]==MAX) continue;
        FOR(k,0,m-1){
          int to = j + c[k];
          // cout << i << " " << to << "\n";
          chmax(to,0);
          chmin(to,255);
          chmin(dp[i+1][to], dp[i][j] + (x[i]-to) * (x[i]-to));
        }
      }
    }

    int ans = 1001001001;
    FOR(i,0,255) chmin(ans,dp[n][i]);
    cout << ans << "\n";
  }
}

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

using namespace std;
using ll=long long;

ll dp[20003][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));
    }
    return dp[i][y]=res+(y-x[i])*(y-x[i]);
}

int main(){
    int n,m;
    while(cin>>n>>m,n){
        for(int i=0;i<20003;++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;
}