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 <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 = 987654321;

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] + (x - val) * (x - val));
					}
				}
				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] + (x - val) * (x - val));
					}
				}
				else
				{
					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] + (x - val) * (x - val));
					}
				}
			}
			dp = ndp;
		}
		int ans = INF;
		for (int can : dp)
		{
			ans = min(ans, can);
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}

struct Info {
    int val;
    int sum;
    Info() {}
    Info(int v, int s) {
	val = v;
	sum = s;
    }
    bool operator< (const Info &a) const {
	return sum < a.sum;
    }
};

signed main() {
    int N, M;
    while (cin >> N >> M) {
	if (N == 0) break;

	vector<int> C, x;
	inputVector(C, M);
	inputVector(x, N);

	vector<Info> v, w;
	v.push_back(Info(128, 0));
	rep(i, N) {
	    w.clear();
	    rep(j, v.size()) {
		rep(k, M) {
		    Info info = v[j];
		    info.val += C[k];
		    if (info.val > 255) info.val = 255;
		    else if (info.val < 0) info.val = 0;
		    info.sum += (x[i] - info.val) * (x[i] - info.val);
		    w.push_back(info);
		}
	    }
	    sort(all(w));
	    if (w.size() > 300) w.resize(300);
	    swap(v, w);
	}
	cout << v[0].sum << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

const int MAXN = 20001;
const int MAXM = 16;
const int MAXX = 256;
const int INF = 1<<28;

int N, M;
int C[MAXM], x[MAXN];
int dp[2][MAXX];

int main() {
  while(cin >> N >> M && (N|M)) {
    for(int i = 0; i < M; ++i) cin >> C[i];
    for(int i = 0; i < N; ++i) cin >> x[i];
    fill(dp[0], dp[2], INF);
    dp[0][128] = 0;
    for(int i = 0; i < N; ++i) {
      const int now = i & 1, next = 1 - now;
      for(int j = 0; j < MAXX; ++j) dp[next][j] = INF;
      for(int j = 0; j < MAXX; ++j) {
        for(int k = 0; k < M; ++k) {
          int nj = min(MAXX - 1, j + C[k]);
          dp[next][nj] = min(dp[next][nj],
                             dp[now][j] + (x[i] - nj) * (x[i] - nj));
        }
      }
    }
    int res = INF;
    for(int j = 0; j < MAXX; ++j) {
      res = min(res, dp[N&1][j]);
    }
    cout << res << endl;
  }
  return 0;
}