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 <cmath>
using namespace std;
int dp[20000][256];
int main(){
  for(int n,m;cin>>n>>m,n;){
    int c[20000],x[20];
    for(int i=0;i<n;i++) fill(dp[i],dp[i]+256,(int)1e9);
    for(int i=0;i<m;i++) cin>>x[i];
    for(int i=0;i<n;i++) cin>>c[i];
    for(int i=0;i<m;i++) dp[0][x[i]+128]=pow(x[i]+128-c[0],2);
    for(int i=1;i<n;i++){
      for(int j=0;j<256;j++){
	if(dp[i-1][j]!=(int)1e9){
	  for(int k=0;k<m;k++){
	    int num=j+x[k];
	    if(num<0) num=0;
	    if(num>255) num=255;
	    dp[i][num]=min(dp[i][num],dp[i-1][j]+(int)pow(c[i]-num,2));
	  }
	}
      }
    }
    /*
      for(int i=0;i<n;i++){
      for(int j=0;j<256;j++) cout<<(dp[i][j]!=1e9?dp[i][j]:-1)<<" ";
      cout<<endl;
      }*/
    int sm=1e9;
    for(int i=0;i<256;i++) sm=min(sm,dp[n-1][i]);
    cout<<sm<<endl;
  }
  return 0;
}

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

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 10000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, m;
int c[100], x[20000];
int dp[20][300];

int main(){
	while (cin >> n >> m&&n + m){
		REP(i, 20)REP(j, 300)dp[i][j] = INF;
		REP(i, m)cin >> c[i];
		REP(i, n)cin >> x[i];
		dp[0][128] = 0;
		REP(i, n){
			REP(j, m){
				REP(k, 256){
					int num = k + c[j];
					if (num < 0)num = 0;
					if (num > 255)num = 255;
					dp[i + 1][num] = min(dp[i][k] + (x[i] - num)*(x[i] - num), dp[i + 1][num]);
				}
			}
		}
		int ans = INF;
		REP(i, 300){
			ans = min(ans, dp[n][i]);
		}
		cout << ans << endl;
	}
}

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

using namespace std;

int main(){
  for(int n,m;cin>>n>>m,n|m;){
    int c[16];
    for(int i=0;i<m;i++){
      cin>>c[i];
    }
    static int ls[20001][256];
    fill(ls[0],ls[20001],1<<30);
    ls[0][128]=0;
    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 n=min(255,max(0,j+c[k]));
	  ls[i+1][n]=min(ls[i+1][n],ls[i][j]+(x-n)*(x-n));
	}
      }
    }
    cout<<*min_element(ls[n],ls[n+1])<<endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#define MAX 2000000000
using namespace std;
static int C[20000];
static int x[20000];
static int dp[20000][256];
int main()
{
	int N, M;
	
	while (cin >> N >> M && N != 0 || M != 0)
	{

		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 < 256; j++)
			{
				if(i == 0)dp[i][j] = 0;
				else dp[i][j] = MAX;
			}
		}
		for (int i = 0; i < N; i++)
		{
			if (i == 0)
			{
				for (int k = 0; k < M; k++)
				{
					int y = 128 + C[k];
					if (y < 0)y = 0;
					else if (y > 255)y = 255;
					int next = y - x[i];
					dp[i + 1][y] = min(dp[i + 1][y], dp[i][128] + next * next);
				}
				continue;
			}
			for (int j = 0; j < 256; j++)
			{
				if (dp[i][j] == MAX)continue;
				for (int k = 0; k < M; k++)
				{
					int y = j + C[k];
					if (y < 0)y = 0;
					else if (y > 255)y = 255;
					int next = (y - x[i]);
					dp[i + 1][y] = min(dp[i + 1][y], dp[i][j] + next * next);
				}
			}
		}

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