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 <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair

const int INF = 1310720000;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};

typedef unsigned long long ull;
typedef std::pair<int,int> P;

int N, M;
int C[16], X[20000];
int dp[20001][256];

int main(){
    while(std::cin >> N >> M, N){
        REP(i, M){
            std::cin >> C[i];
        }
    
        FOR(i, 1, N+1){
            std::cin >> X[i];
        }

        REP(i, N+1){
            REP(y, 256){
                dp[i][y] = INF;
            }
        }
        dp[0][128] = 0;

        FOR(i, 0, N){
            REP(y, 256){
                REP(j, M){
                    int ny = y+C[j];
                    if(ny < 0){ny = 0;}
                    else if(ny > 255){ny = 255;}

                    dp[i+1][ny] = std::min(dp[i+1][ny], dp[i][y] + (X[i+1]-ny) * (X[i+1]-ny));
                }
            }
        }

        // FOR(i, 1, N+1){
        //     REP(y, 256){
        //         printf("%d, ", dp[i][y]);
        //     }
        //     puts("");
        // }

        //printf("%d\n", dp[2][136]);

        int min_sum = INF;
        REP(i, 256){
            min_sum = std::min(min_sum, dp[N][i]);
        }

        std::cout << min_sum << std::endl;
    }
}

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

using namespace std;

int main() {
	int n, m;
	while (cin >> n >> m) {
		if (n == 0 && m == 0) {
			break;
		}
		vector<long long int> code(m);
		for (int i = 0; i < m; i++) {
			cin >> code[i];
		}
		vector<long long int> x(n);
		for (int i = 0; i < n; i++) {
			cin >> x[i];
		}
		vector< vector<long long int> > dp(n, vector<long long int>(256, -1));
		for (int i = 0; i < m; i++) {
			long long int a = 128+code[i];
			if (a < 0) {
				a = 0;
			} else if (a > 255) {
				a = 255;
			}
			dp[0][a] = (x[0]-a)*(x[0]-a);
			//cout << a << ' ' << dp[0][a] << endl;
		}
		for (int i = 0; i < n-1; i++) {
			for (int j = 0; j < 256; j++) {
				for (int k = 0; k < m; k++) {
					long long int a = j+code[k];
					if (a < 0) {
						a = 0;
					} else if (a > 255) {
						a = 255;
					}
					if (dp[i][j] != -1) {
						if (dp[i+1][a] == -1) {
							dp[i+1][a] = dp[i][j]+(x[i+1]-a)*(x[i+1]-a);
						} else {
							dp[i+1][a] = min(dp[i+1][a], dp[i][j]+(x[i+1]-a)*(x[i+1]-a));
						}
					}
				}
			}
			//cout << dp[i][255] << endl;
		}
		long long int MIN = -1;
		for (int i = 0; i < 256; i++) {
			if (MIN == -1) {
				MIN = dp[n-1][i];
			} else if (dp[n-1][i] != -1){
				MIN = min(MIN, dp[n-1][i]);
			}
		}
		cout << MIN << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
int INF = 1e9;
int main(){
    while(1){
        int N, M;
        std::cin >> N >> M;
        if(N == 0 && M == 0)break;
        std::vector<int> C(M), x(N);
        for(int i = 0; i < M; i++) std::cin >> C[i];
        for(int i = 0; i < N; i++) std::cin >> x[i];
        int dp[N + 1][256];
        for(int i = 0; i < N + 1; i++) for(int k = 0; k < 256; k++) dp[i][k] = INF;
        dp[0][128] = 0;
        for(int i = 0; i < N; i++){
            for(int j = 0; j < M; j++){
                for(int k = 0; k < 256; k++){
                    if(k + C[j] > 255) dp[i + 1][255] = std::min(dp[i + 1][255], dp[i][k] + std::abs(255 - x[i])*std::abs(255 - x[i]));
                    else if(k + C[j] < 0) dp[i + 1][0] = std::min(dp[i + 1][0], dp[i][k] + std::abs(0 - x[i])*std::abs(0 - x[i]));
                    else dp[i + 1][k + C[j]] = std::min(dp[i + 1][k + C[j]], dp[i][k] + std::abs(k + C[j] - x[i])*std::abs(k + C[j] - x[i]));
                }
            }
        }
        int ans = INF;
        for(int j = 0; j < 256; j++) ans = std::min(ans, dp[N][j]);
        std::cout << ans << std::endl;
    }
}

C++: //Yattazo! Watashiha-Yosen-tsuukashita! It's 460points/600points! OHO!!!!!
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int x[21000][256],n,m,y[64000],z[64000],d,minx;
int main(){
	while(true){
		minx=2000000000;
		for(int i=0;i<21000;i++){for(int j=0;j<256;j++){x[i][j]=2000000000;}}
		cin>>n>>m;if(!n){break;}
		for(int i=0;i<m;i++){cin>>y[i];}
		for(int i=1;i<=n;i++){cin>>z[i];}
		x[0][128]=0;
		for(int i=1;i<=n;i++){
			for(int j=0;j<256;j++){
				if(x[i-1][j]<1000000000){
					for(int k=0;k<m;k++){
						d=y[k]+j;
						if(d<0){d=0;}
						if(d>255){d=255;}
						x[i][d]=min(x[i][d],x[i-1][j]+(int)pow(1.0*(z[i]-d),2));
					}
				}
			}
		}
		for(int i=0;i<256;i++){minx=min(minx,x[n][i]);}
		cout<<minx<<endl;
	}
}