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>

using namespace std;

long long int ans;

int min(int a,int b){
	if(a>=b)return b;
	else return a;
}

int main(){

	int n,m;
	long long int dp[20010][256];
	int next;

	while(cin>>n>>m){
		ans = 1000000000000;
		if(n==0 && m==0){
			break;
		}
		int *c;
		int *x;
		c = new int[m];
		x = new int[n];

		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;i++){
			for(int j=0;j<256;j++){
				dp[i][j]=10000000000;
			}
		}

		for(int i=0;i<m;i++){
			next = 128+c[i];
			if(next>=255)next=255;
			if(next<=0)next = 0;
			dp[0][next] = (x[0]-next)*(x[0]-next);
		}
		/*
		for(int i=0;i<256;i++){
			cout<<dp[0][i]<<" ";
		}
		cout<<endl;
		*/
		for(int i=1;i<n;i++){
			for(int j=0;j<256;j++){
				for(int k=0;k<m;k++){
					next = j+c[k];
					if(next>=255)next=255;
					if(next<=0)next = 0;
					//dp[next] = min(dp[next],dp[j]+(x[i]-next)*(x[i]-next));
					dp[i][next] = min(dp[i][next],dp[i-1][j]+(x[i]-next)*(x[i]-next));
				}
			}
		}
		for(int i=0;i<256;i++){
			ans = min(ans,dp[n-1][i]);
		}


		cout<<ans<<endl;

	}

	return 0;

}

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 = 100000000;
		for(int i = 1; i < 256; i++) ans = min(ans, result[n][i]);
		cout << ans << endl;
	}
	return 0;
}

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

int main() {
  while (true) {
    int N, M;
    std::cin >> N >> M;
    if (N == 0 && M == 0) {
      break;
    }
    std::vector<int> C, X;
    for (int i = 0; i < M; i++) {
      int c;
      std::cin >> c;
      C.push_back(c);
    }
    for (int i = 0; i < N; i++) {
      int x;
      std::cin >> x;
      X.push_back(x);
    }
    const int kMaxErr = 255 * 255 * N;
    std::vector<int> dp(256, kMaxErr);
    dp[128] = 0;
    for (int x : X) {
      std::vector<int> new_dp(256, kMaxErr);
      for (int i = 0; i < 256; i++) {
        for (int c: C) {
          int new_val = std::max(0, std::min(255, i + c));
          int err = (new_val - x) * (new_val - x);
          new_dp[new_val] = std::min(new_dp[new_val], dp[i] + err);
        }
      }
      dp = std::move(new_dp);
    }
    int ans = kMaxErr;
    for (int err : dp) {
      ans = std::min(ans, err);
    }
    std::cout << ans << std::endl;
  }
}

C++: //#include <bits/stdc++.h>
#include<iostream>
#include<stdio.h>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>


#define FOR(i, a, b) for( int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for( int i=(a);i>=(b);i--)
#define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LLINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000

using namespace std;
typedef long long int ll;
typedef pair< long long int, long long  int> P;


int main(void) {
	
	while (1) {
		int n, m;
		int mini = INF;

		cin >> n >> m;
		if (n == 0) {
			break;
		}
		vector<int> c(m + 1,0);
		vector<int> x(n + 1,0);
		vector< vector<int> > dp(n + 1, vector<int>(256, INF));

		FOR(i, 1, m) {
			cin >> c[i];
		}
		FOR(i, 1, n) {
			cin >> x[i];
		}

		dp[0][128] = 0;

		FOR(i, 1, n) {
			FOR(k, 0, 255) {
				FOR(j, 1, m) {
					//cout << i << " " << j << " " << k << endl;//1 3 128
					
					if (dp[i - 1][k] != INF) {
						int p;
						if (k + c[j] >= 255) {
							p = 255;
						}
						else if (k + c[j] <= 0) {
							p = 0;
						}
						else {
							p = k + c[j];
						}
						dp[i][p] = min(dp[i][p], dp[i - 1][k] + (abs(x[i] - p))*(abs(x[i] - p)));
					}

				}
			}
		}

		FOR(i, 0, 255) {
			//cout << i << " " << dp[n][i] << endl;
			if (dp[n][i] < mini) {
				mini = dp[n][i];
			}
		}
		
		cout << mini << endl;
	}
	return 0;
}