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<algorithm>

using namespace std;
typedef long long ll;

ll c[16], x[20000];

ll dp[20001][256];

int main() {
	while (1) {
		int n, m;
		cin >> n >> m;
		if (n + m == 0)break;
		for (int i = 0; i < m; i++)cin >> c[i];
		for (int i = 0; i < n; i++)cin >> x[i];

		for (int i = 0; i < 21; i++)for (int j = 0; j < 256; j++)dp[i][j] = 1e18;
		dp[0][128] = 0;

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

		ll ans = 1e18;

		for (int i = 0; i < 256; i++) {
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;

	}

	return 0;
}

C++: #include <iostream>
#include <algorithm>

#define INF (1 << 29)

#define MAX_N 20000
#define MAX_M 16

using namespace std;

int N, M, C[MAX_M], X, dp[MAX_N + 1][256];

int main()
{
	for (int i = 0; i < MAX_N + 1; i++)
	{
		for (int j = 0; j < 256; j++)
		{
			dp[i][j] = INF;
		}
	}

	dp[0][128] = 0;

	cin >> N >> M;

	for (int i = 0; i < M; i++) { cin >> C[i]; }

	for (int i = 1; i <= N; i++)
	{
		cin >> X;

		for (int j = 0; j < 256; j++)
		{
			int sabun = (X - j) * (X - j);

			for (int k = 0; k < M; k++)
			{
				int ptr = j - C[k];

				if (ptr < 0) { ptr = 0; }
				if (ptr > 255) { ptr = 255; }

				dp[i][j] = min(dp[i][j], dp[i - 1][ptr] + sabun);
			}
		}
	}

	cout << *min_element(dp[N], dp[N] + 256) << endl;

	return 0;
}

C++: #include <iostream>
#include <climits>
#include <algorithm>
#define MAX_N 20000
#define MAX_M 16
#define MAX_X 255
#define INIT 128
using namespace std;

typedef pair<int, int> P;

long long int dp[MAX_N][MAX_X + 1];
int c[MAX_M], x[MAX_N];
int n, m;

long long int solve(int back, int depth, int k) {
  if (depth == n) return 0;
  int t = back + c[k];
  if (t < 0) t = 0;
  else if (t > 255) t = 255;

  if (dp[depth][t] < LONG_MAX) return dp[depth][t];

  long long int thismin = LONG_MAX;
  for (int i = 0; i < m; i++) {
    thismin = min(thismin, solve(t, depth + 1, i));
  }

  int a = x[depth] - t;
  int b = thismin + a * a;
  dp[depth][t] = b;
  return dp[depth][t];
}

void init() {
  for (int i = 0; i < MAX_M; i++)
    for (int j = 0; j < MAX_X + 1; j++)
      dp[i][j] = LONG_MAX;
}

int main() {
  while (true) {
    cin >> n >> m;
    if (n == 0 && m == 0) return 0;

    for (int i = 0; i < m; i++)
      cin >> c[i];
    for (int i = 0; i < n; i++)
      cin >> x[i];

    init();
    long long int thismin = LONG_MAX;
    for (int i = 0; i < m; i++) {
      thismin = min(thismin, solve(INIT, 0, i));
    }
    cout << thismin << endl;
  }
}

C++: #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;

#define MAX_N 20001
#define MAX_Y 256

int N, M;
vector<int> C, X;
int dp[MAX_Y][MAX_N];
bool vis[MAX_Y][MAX_N];

int solve(int y, int n)
{
    if (vis[y][n])
        return dp[y][n];
    vis[y][n] = true;
    if (n == N)
        return dp[y][n] = 0;
    int res = INF;
    rep(i, M)
    {
        int nxt = y + C[i];
        nxt = max(nxt, 0LL);
        nxt = min(nxt, 255LL);
        int d = nxt - X[n];
        res = min(res, solve(nxt, n + 1) + d * d);
    }
    return dp[y][n] = res;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    while (1)
    {
        cin >> N >> M;
        if (N == 0)
            break;
        C.resize(M);
        rep(i, M) cin >> C[i];
        X.resize(N);
        rep(i, N) cin >> X[i];
        rep(i, MAX_Y) rep(j, MAX_N) vis[i][j] = false;
        cout << solve(128, 0) << endl;
    }
}

C++: #include<iostream>
#include<algorithm>

using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define SQ(n) ((n)*(n))
const int inf=1<<28;

int n,m,code[16],in[20000];
int dp[2][256];

int func(int n)
{
	if(n<0)return 0;
	return min(255,n);
}

int main(){
	while(cin>>n>>m,n)
	{
		rep(i,m)cin>>code[i];
		rep(i,n)cin>>in[i];
		
		fill_n(dp[0],256,inf);
		dp[0][128]=0;
		
		int cur=0,next=1;
		for(int i=1;i<=n;i++)
		{
			fill_n(dp[next],256,inf);
			rep(j,256)rep(k,m)dp[next][func(j+code[k])]=min(
				dp[next][func(j+code[k])],dp[cur][j]+
				SQ(func(j+code[k])-in[i-1])
			);
			swap(cur,next);
		}
		
		cout<<*min_element(dp[cur],dp[cur]+256)<<endl;
	}
	return 0;
}