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++) {
					ll nxt = 0;
					nxt = j + c[k];
					if (nxt < 0)nxt = 0;
					if (nxt > 255)nxt = 255;
					
					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 <cstdio>

using namespace std;

typedef long long ll;

ll dp[20010][256];
int book[20];
int input[20010];
int N, M;

static const ll MAX = 10000000000;

void init() {
  fill(&dp[0][0], &dp[20009][256], MAX);
}

void solve() {
  dp[0][128] = 0;

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 256; j++) {
      for (int k = 0; k < M; k++) {
        int tar = j + book[k];
        if (tar < 0) {
          tar = 0;
        } else if (tar > 255) {
          tar = 255;
        }
        ll sub = tar - input[i];
        sub *= sub;
        dp[i + 1][tar] = min(dp[i + 1][tar], dp[i][j] + sub);
      }
    }
  }

  ll mn = MAX;
  for (int i = 0; i < 256; i++) {
    mn = min(mn, dp[N][i]);
  }
  printf("%ld\n", mn);
}

int main() {
    while (true) {
      scanf("%d %d ", &N, &M);
      if (N == 0 && M == 0) {
        break;
      }
      init();
      for (int i = 0; i < M; i++) {
        scanf("%d ", &book[i]);
      }
      for (int i = 0; i < N; i++) {
        scanf("%d ", &input[i]);
      }
      solve();
    }
}

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

#define M_PI       3.14159265358979323846   // pi

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;

#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)

using namespace std;

static const ll INF = 1e15;


int main() {
    while (true) {
        ll n, m;
        cin >> n >> m;
        if (n == 0 && m == 0) return 0;
        vector<ll> cs(m);
        rep(i, m) cin >> cs[i];
        vector<ll> xs(n);
        rep(i, n) cin >> xs[i];

        vector<vector<ll>> dp(n + 1, vector<ll>(256, INF));
        dp[0][128] = 0;
        rep(i, n) {
            rep(j, 256) {
                if (dp[i][j] == INF) continue;
                rep(a, m) {
                    int diff = cs[a];
                    int next = max(0, min(255, (int)j + diff));
                    ll dx = next - xs[i];
                    dx *= dx;
                    dp[i + 1][next] = min(dp[i + 1][next], dx + dp[i][j]);
                }
            }
        }
        ll u = INF;
        rep(j, 256) {
            u = min(u, dp[n][j]);
        }
        cout << u << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
 
using namespace std;
 
int main()
{
	long long n;
	int m;
	while(cin>>n>>m,n){
		vector<int> c(m),x(n);
		for(int i=0;i<m;i++) cin>>c[i];
		for(long long i=0;i<n;i++) cin>>x[i];

		vector<vector<long long> > dp(n+1,vector<long long>(256,100000000LL));

		dp[0][128]=0;

		for(long i=0;i<n;i++){
			for(int j=0;j<256;j++){
				for(int k=0;k<m;k++){
					int tmp=j+c[k];
					tmp=min(tmp,255);
					tmp=max(tmp,0);
					dp[i+1][tmp]=min(dp[i+1][tmp],dp[i][j]+(tmp-x[i])*(tmp-x[i]));
				}
			}
		}

		long long res=dp[n][0];
		for(int i=1;i<256;i++) res=min(res,dp[n][i]);
		cout<<res<<endl;

	}

	return 0;
}

C++: #include <iostream>
#define INF 1e+18
#define int long long
using namespace std;

int dp[20001][256];

signed main(){
	int n,m,c[16];
	while(cin >> n >> m,n){
		for(int i = 0;i <= n;i++){
			for(int j = 0;j < 256;j++) 
			if(i) dp[i][j] = INF;
			else dp[i][j] = 0;
		}
		for(int i = 0;i < m;i++) cin >> c[i];
		for(int i = 0;i < n;i++){
			int x;
			cin >> x;
			for(int j = 0;j < 256;j++){
				for(int k = 0;k < m;k++){
					int d = j + c[k];
					if(d < 0) d = 0;
					else if(d > 255) d = 255;
					dp[i + 1][d] = min(dp[i + 1][d],dp[i][j] + (x - d) * (x - d));
				}
			}
		}
		int mi = INF;
		for(int i = 0;i < 256;i++) mi = min(mi,dp[n][i]);
		cout << mi << endl;
	}
	return 0;
}