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<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265

int dp[21000][300];

void f(int n,int m){

  FOR(i,1,n+1){
    rep(j,300){
      dp[i][j] = inf;
    }
  }
  int c[1000];
  rep(i,m){
    cin>>c[i];
  }

  FOR(i,1,n+1){
    int x;
    cin>>x;
    rep(j,256){
      rep(k,m){
        int a = j+c[k];
        a = min(255,a);
        a = max(0,a);
        int d = (a-x)*(a-x);
        dp[i][a] = min(dp[i][a],dp[i-1][j]+d);
      }
    }

  }
  int ans = inf;
  rep(i,256){
    ans = min(ans,dp[n][i]);
  }

  cout<<ans<<endl;

}

int main(){
  while(1){
    int n,m;
    cin>>n>>m;
    if(n==0&&m==0) break;
    f(n,m);
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
#include <unordered_map>
int square(int x){
	return x * x;
}
int main()
{
	using namespace std;
	int N, M, i, j, c, k, v, y, sub_sq, min;
	vector <int> C, x;
	unordered_map <int, int> :: iterator it;
	while (true) 
	{
		cin >> N >> M;
		if (N == 0 and M == 0) break;
		C.resize(M); x.resize(N);
		for (i=0;i<M;i++) cin >> C[i];
		for (i=0;i<N;i++) cin >> x[i];
		unordered_map <int, int> dp;
		dp[128] = 0;
		for(i = 0; i < N; i++)
		{
			unordered_map <int, int> tmpdp;
			for (it = dp.begin();it != dp.end(); it++)
			{
				k = it->first; v = it->second;
				for(j = 0; j < M; j++)
				{
					c = C[j];
					if (k + c > 255) y = 255;
					else if (k + c < 0) y = 0;
					else y = k + c;
					sub_sq = square(x[i]-y);
					if(not(tmpdp.count(y) != 0 and v + sub_sq >= tmpdp[y])) 
						tmpdp[y] = v + sub_sq;
				}
			}
			dp = tmpdp;
		}
		it = dp.begin();
		min = it -> second;
		it++;
		for(;it != dp.end();it++) min = min < it -> second ? min : it -> second;  
		cout << min << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cmath>
#define int long long
using namespace std;
int dp[20000][256];
signed 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]=(int)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 <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <string>
#include <cmath>
#define REP(i,a,b) for (int i = a; i < (b); i++)
#define sz(t) int(t.size())
#define INF 1000000000
const int DIV = 1000000000 + 7;
using namespace std;
typedef long long ll;

#define MOD 10007

int main(void) {
    for (;;) {
        int n, m;
        cin >> n >> m;
        if (n == 0 && m == 0) {
            break;
        }
        vector<int> C;
        vector<int> X;
        REP(i, 0, m) {
            int c;
            cin >> c;
            C.push_back(c);
        }
        REP(i, 0, n) {
            int x;
            cin >> x;
            X.push_back(x);
        }

        vector<int> dp(256, INF);
        dp[128] = 0;
        REP(i, 0, n) {
            vector<int> new_dp(256, INF);
            REP(y, 0, 256) {
                for (auto c : C) {
                    int target = y + c;
                    if (target > 255) {
                        target = 255;
                    } else if (target < 0) {
                        target = 0;
                    }
                    new_dp[target] = min(new_dp[target], (int)(dp[y] + pow(X[i] - target, 2)));
                }
            }
            dp = new_dp;
        }
        int ans = INF;
        REP(i, 0, 256) {
            ans = min(ans, dp[i]); 
        }
        cout << ans << endl;
    }
}

// while True:
//     N, M = map(int, input().split())
//     if N == 0 and M == 0:
//         break

//     C = [0] * M
//     for i in range(M):
//         C[i] = int(input())
//     X = [0] * N
//     for i in range(N):
//         X[i] = int(input())

//     dp = [INF] * 256 
//     dp[128] = 0
//     for i in range(N):
//         new_dp = [INF] * 256
//         for val in range(0, 256):
//             for c in C:
//                 target = val + c
//                 if target > 255:
//                     target = 255
//                 elif target < 0:
//                     target = 0
//                 new_dp[target] = min(new_dp[target], dp[val] + (target - X[i]) ** 2)
//         dp = new_dp
//     print(min(dp))