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++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  while (true) {
    int n, m;
    cin >> n >> m;
    if (n == 0 && m == 0) return 0;
    vector<int> c(m);
    for (int i = 0; i < m; i++) {
      cin >> c[i];
    }
    vector<int> x(n);
    for (int i = 0; i < n; i++) {
      cin >> x[i];
    }
    long long inf = 1LL << 60;
    vector<vector<long long>> dp(n + 1, vector<long long>(256, inf));
    dp[0][128] = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j <= 255; j++) {
        if (dp[i][j] == inf) continue;
        for (int k = 0; k < m; k++) {
          int s = min(255, max(0, j + c[k]));
          dp[i + 1][s] = min(dp[i + 1][s], dp[i][j] + 1LL * (s - x[i]) * (s - x[i]));
        }
      }
    }
    long long ans = inf;
    for (int i = 0; i <= 255; i++) {
      ans = min(ans, dp[n][i]);
    }
    cout << ans << '\n';
  }
  return 0;
}

C++: #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>

using namespace std;

#define INF 1000000000
#define EPS 1e-9
#define PI (atan(1.0) * 4.0)

typedef pair<int, int> P;
typedef long long ll;

#define MAX_M 16
#define MAX_N 20000

int N, M;
int C[MAX_M];
int x[MAX_N];

ll dp[MAX_N+1][256];

vector<int> ans_list;

int main(){

	while (true){

		cin >> N >> M;

		if (N == 0 && 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 < N + 1; i++){
			for (int j = 0; j <= 255; j++){
				dp[i][j] = INF;
			}
		}

		dp[0][128] = 0;

		for (int i = 0; i < N; i++){
			for (int j = 0; j <= 255; j++){
				if (dp[i][j] == INF)
					continue;
				for (int m = 0; m < M; m++){
					if (j + C[m] < 0){
						dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + (0 - x[i])*(0 - x[i]));
					}
					else if (j + C[m] > 255){
						dp[i + 1][255] = min(dp[i + 1][255], dp[i][j] + (255 - x[i])*(255 - x[i]));
					}
					else
						dp[i + 1][j + C[m]] = min(dp[i + 1][j + C[m]], dp[i][j] + (j + C[m] - x[i])*(j + C[m] - x[i]));
				}
			}
		}

		ll ans = INF;
		for (int i = 0; i <= 255; i++){
			ans = min(ans, dp[N][i]);
		}

		ans_list.push_back(ans);

	}

	for (int i = 0; i < ans_list.size(); i++){
		cout << ans_list[i] << endl;
	}

	return 0;

}

C++: #include <iostream>
using namespace std;
int n,m,a,b,dp[20001][256],s[20000],t[16],ans,L;
void ini(void){
    for(int i=0;i<=20000;i++){
        for(int j=0;j<256;j++){
            dp[i][j]=1e9;
        }
    }
}
int main(void){
    while(1){
    cin>>n>>m;
    if(n==0&&m==0)return 0;
    ans=1e9;
    ini();
    for(int i=0;i<m;i++){
        cin>>t[i];
    }
    for(int i=0;i<n;i++)cin>>s[i];
    dp[0][128]=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<=255;j++){
            if(dp[i][j]==1e9)continue;
            for(int k=0;k<m;k++){
                L=j+t[k];
                L=min(255,L);
                L=max(0,L);
                dp[i+1][L]=min(dp[i+1][L],dp[i][j]+(L-s[i])*(L-s[i]));
            }
        }
    }
    for(int i=0;i<256;i++){
        //cout<<dp[n][i]<<endl;
        ans=min(ans,dp[n][i]);
    }
    cout<<ans<<endl;
    }
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

typedef long long lli;

const int MAX_N = 20001;
const int MAX_M = 16;
const int MAX_V = 256;
const int INF = 1<<24;

lli T[MAX_N][MAX_V];
int N, M;
lli C[MAX_M];
lli x[MAX_N];

lli solve() {
  fill(T[0], T[N+1], INF);
  T[0][128] = 0LL;
  for(int i = 1; i <= N; ++i) {
    for(int j = 0; j <= 255; ++j) {
      for(int k = 0; k < M; ++k) {
	lli value = j + C[k];
	if(value < 0LL) value = 0LL;
	if(value > 255LL) value = 255LL;
	T[i][value] = min(T[i][value], T[i-1][j] + (x[i]-value)*(x[i]-value));
      }
    }
  }
  lli res = INF;
  for(int i = 0; i <= 255; ++i) {
    res = min(res, T[N][i]);
  }
  return res;
}

int main() {
  while(cin >> N >> M && (N || M)) {
    for(int i = 0; i < M; ++i) {
      cin >> C[i];
    }
    for(int i = 1; i <= N; ++i) {
      cin >> x[i];
    }
    cout << solve() << endl;
  }
}