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 <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
  
using namespace std;

#define pi 3.141592653589793

int result[20001][256];

int main()
{
	int n, m;
	while(1){
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		for(int i = 0; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				result[i][j] = 100000000;
			}
		}
		result[0][128] = 0;
		int c[17], x[20001];
		for(int i = 1; i < m + 1; i++){
			cin >> c[i];
		}
		for(int i = 1; i < n + 1; i++){
			cin >> x[i];
		}
		for(int i = 1; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				for(int k = 1; k < m + 1; k++){
					int nexty = j + c[k];
					if(nexty < 0) nexty = 0;
					else if(nexty > 255) nexty = 255;
					result[i][nexty] = min(result[i][nexty], result[i - 1][j] + (x[i] - nexty) * (x[i] - nexty));
				}
			}
		}
		int ans = 10000000;
		for(int i = 1; i < 256; i++) ans = min(ans, result[n][i]);
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=2e9;
double EPS=1e-10;
int main(){
      int n,m;
      while(cin>>n>>m&&(n||m)){
            int a[n],b[m];
            int dp[n+1][256];
            REP(i,m)cin>>b[i];
            REP(i,n)cin>>a[i];
            REP(i,n+1)REP(j,256)dp[i][j]=-1;
            dp[0][128]=0;
            REP(i,n){
                  REP(j,256){
                        if(dp[i][j]==-1)continue;
                        REP(k,m){
                              int nxt=j+b[k];
                              nxt=max(0,min(255,nxt));
                              if(dp[i+1][nxt]==-1)dp[i+1][nxt]=dp[i][j]+(a[i]-nxt)*(a[i]-nxt);
                              else dp[i+1][nxt]=min(dp[i+1][nxt],dp[i][j]+(a[i]-nxt)*(a[i]-nxt));
                        }
                  }
            }
            int ans=-1;
            REP(i,256)if(dp[n][i]!=-1){
                  if(ans==-1)ans=dp[n][i];
                  else ans=min(ans,dp[n][i]);
            }
            cout<<ans<<endl;
      }
}

C++: #include<iostream>
using namespace std;
typedef long long ll;

const ll INF = 1LL << 50;

ll C[22], X[20202];
ll dp[20202][256];

void solve(int n, int m) {
    for (int i = 0; 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 <= 255; j++) dp[i][j] = INF;
    }
    dp[0][128] = 0;
    for (int i = 0; i < n; i++) {
        for (ll j = 0; j <= 255; j++) {
            if (dp[i][j] == INF) continue;
            for (int k = 0; k < m; k++) {
                ll next_num = min(max(j + C[k], 0LL), 255LL);
                dp[i + 1][next_num] = min(dp[i][j] + (X[i + 1] - next_num) * (X[i + 1] - next_num), dp[i + 1][next_num]);
            }
        }
    }
    ll ans = INF;
    for (ll i = 0; i <= 255; i++) {
        ans = min(ans, dp[n][i]);
    }
    cout << ans << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    while (true) {
        cin >> N >> M;
        if (N == 0 && M == 0) break;
        solve(N, M);
    }
    return 0;
}

C++: 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
using namespace std;

const int INF = 1087654321;

int main(void)
{
	for (;;)
	{
		int n, m;
		cin >> n >> m;
		if (!n)break;
		vector<int>c;
		for (int i = 0; i < m; ++i)
		{
			int cc; cin >> cc;
			c.push_back(cc);
		}
		array<int, 256>dp;
		fill(dp.begin(), dp.end(), INF);
		dp[128] = 0;
		for (int i = 1; i <= n; ++i)
		{
			array<int, 256>ndp;
			fill(ndp.begin(), ndp.end(), INF);
			int x;
			cin >> x;
			for (int val = 0; val < 256; ++val)
			{
				/*
				if (val == 0)
				{
					int gap = -1;
					for (int ck : c)gap = max(gap, -ck);
					for (int old = 0; old <= gap; ++old)
					{
						ndp[val] = min(ndp[val], dp[old]);
					}
				}
				else if (val == 255)
				{
					int gap = -1;
					for (int ck : c)gap = max(gap, ck);
					for (int old = 255 - gap; old < 256; ++old)
					{
						ndp[val] = min(ndp[val], dp[old]);
					}
				}
				//*/
				for (int ck : c)
				{
					/*
					int old = val - ck;
					if (old < 0)old = 0;
					if (old >= 256)old = 255;
					ndp[val] = min(ndp[val], dp[old]);
					//*/
					ndp[min(255, max(val + ck, 0))] = min(ndp[min(255, max(val + ck, 0))], dp[val]);
				}
			}
			for (int i = 0; i < 256; ++i)
			{
				dp[i] = ndp[i] + (x - i) * (x - i);
			}
		}
		int ans = INF;
		for (int can : dp)
		{
			ans = min(ans, can);
		}
		cout << ans << endl;
	}
	return 0;
}