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;

const int MAX_N = 20000;
const int MAX_M = 16;
const int INF = 1e8;
const int y0 = 128;
int N, M;
int C[MAX_M + 1], x[MAX_N + 1];
int dp[MAX_N + 10][260];

int main()
{
    while (cin >> N >> M, N || M) {
        // Input
        for (int i = 0; i < M; ++i)
            cin >> C[i];
        for (int i = 0; i < N; ++i)
            cin >> x[i];

        // Init
        for (int i = 0; i <= N; ++i)
            fill(dp[i], dp[i] + 259, INF);
        dp[0][128] = 0;

        // Solve
        for (int n = 0; n < N; ++n) {
            for (int y = 0; y <= 255; ++y) {
                for (int i = 0; i < M; ++i) {
                    int next_y = y + C[i];
                    if (next_y < 0)
                        next_y = 0;
                    else if (next_y > 255)
                        next_y = 255;

                    dp[n + 1][next_y] = min(dp[n + 1][next_y],
                                            dp[n][y] + (x[n] - next_y) * (x[n] - next_y));
                }
            }
        }

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

        cout << ans << endl;
    }

    return 0;
}

C++: #include<iostream>
#include<string.h>
using namespace std;

int cut(int n){
	if(n<0) return 0;
	if(n>255) return 255;
	return n;
}

		int dp[20001][256];
int main()
{
	int N,M;
	while(cin>>N>>M && N!=0){
		int book[16],signal[20000];
		memset(book,-1,sizeof(bool));
		memset(signal,-1,sizeof(signal));

		for(int i=0;i<M;i++)
			cin>>book[i];
		for(int i=0;i<N;i++)
			cin>>signal[i];


		memset(dp,-1,sizeof(dp));
		dp[0][128]=0;

		for(int i=0;i<N;i++){
			for(int j=0;j<=255;j++){
				if(dp[i][j]<0) continue;
				for(int k=0;k<M;k++){
					if(dp[i+1][cut(j+book[k])]<0)
						dp[i+1][cut(j+book[k])]=dp[i][j]+(signal[i]-cut(j+book[k]))*(signal[i]-cut(j+book[k]));
					else min(dp[i+1][cut(j+book[k])],dp[i][j]+(signal[i]-cut(j+book[k]))*(signal[i]-cut(j+book[k])));
				}
			}
		}
		int ans=100000000;


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

C++: #include <iostream>
#include <string.h>
#include <algorithm>

#define N 50000
#define M 20
#define lengthof(x) (sizeof(x)/sizeof(*(x)))

int c[M];
int sum[256];
int bsum[256];

using namespace std;

int main(void)
{
	int n,m;
	int x;
	int i1,i2,i3;
	int minn;
	int temp;

	while(1){
		cin>>n>>m;
		if(n+m==0) break;

		memset(bsum,-1,sizeof(bsum));
		bsum[128]=0;

		for(i1=0;i1<m;i1++){
			cin>>c[i1];
		}

		for(i1=0;i1<n;i1++){
			cin>>x;
			fill((int*)sum,(int*)(sum+lengthof(sum)),INT_MAX);
			for(i2=0;i2<256;i2++){
				if(bsum[i2]!=-1){
					for(i3=0;i3<m;i3++){
						temp=i2+c[i3];
						if(temp<0) temp=0;
						if(255<temp) temp=255;

						sum[temp]=min(sum[temp],bsum[i2]+(temp-x)*(temp-x));
					}
				}
			}

			for(i2=0;i2<256;i2++){
				if(sum[i2]<INT_MAX) bsum[i2]=sum[i2];
				else bsum[i2]=-1;
			}
		}

		minn=sum[0];
		for(i1=0;i1<256;i1++){
			if(minn>sum[i1]) minn=sum[i1];
		}

		cout<<minn<<endl;

	}
	return 0;
}

C++: #include<iostream>
using namespace std;
#define rep(i, n) for ( int i = 0; i < n; i++ )
#define NMAX 20001
#define MMAX 16
#define INFTY (1<<21)
int N, M, C[MMAX], X[NMAX], T[256][NMAX];

int compute(){
    rep(i, 256) rep(j, N+1) T[i][j] = INFTY;
    T[128][0] = 0;
    rep(j, N){
	rep(i,256){
	    if ( T[i][j] == INFTY ) continue;
	    rep(k, M){
		int p = i + C[k];
		if ( p > 255 ) p = 255;
		if ( p < 0 ) p = 0;
		T[p][j+1] = min(T[p][j+1], T[i][j] + (X[j+1]-p)*(X[j+1]-p));
	    }
	}
    }
    int minv = INFTY;
    rep(i, 256) minv = min(minv, T[i][N]);
    return minv;
}

main(){
    while(cin >> N >> M && N ){
	rep(i, M) cin >> C[i];
	rep(i, N) cin >> X[i+1];
	cout << compute() << endl;
    }
}