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>
#define INF 0x3f3f3f3f
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

int c[16], x[16];
int dp[70001][256];
int d(int a) {
	if (a < 0)return 0;
	if (a > 255)return 255;
	return a;
}
int diff(int i, int a) {
	return (x[i] - a)*(x[i] - a);
}
int main() {
	int n, m;
	while (scanf("%d%d", &n, &m), n) {
		rep(i, m)scanf("%d", &c[i]);
		rep(i, n)scanf("%d", &x[i]);
		memset(dp, 0x3f, sizeof(dp));
		dp[0][128] = 0;
		rep(i, n)rep(j, 256) {
			if (dp[i][j] == INF)continue;
			rep(k, m) {
				int a = d(j + c[k]);
				if (i + 1 >= 20001)return 0;
				dp[i + 1][a] = min(dp[i + 1][a], dp[i][j] + diff(i, a));
			}
		}
		int Min = INF;
		rep(j, 256)Min = min(Min, dp[n][j]);
		printf("%d\n", Min);
	}
}

C++: #include <iostream>
#include <vector>
#include <climits>
using namespace std;

#define INF 1 << 24
#define SQUARE(n) ((n)*(n))
typedef long INT;
typedef vector <int> VI;
typedef vector <VI> VVI;

int main( void )
{
	int n, m; // N: üÍM, M: R[hubNÌ·³
	while ( cin >> n >> m && n && m )
	{
		// üÍ
		VI C(m);
		for ( int i = 0; i < m; i++ )
		{
			cin >> C[i];
		}
		VI x(n+1);
		x[0] = 0;
		for ( int i = 0; i < n; i++ )
		{
			cin >> x[i+1];
		}

		VVI  dp = VVI( n+1, VI( 256, INF ) );
		dp[0][128] = 0;

		for ( int k = 1; k <= n; k++ )
		{
			for ( int i = 0; i < 256; i++ )
			{
				for ( int j = 0; j < m; j++ )
				{
					int next = i + C[j];
					next = next < 0 ? 0 : next;
					next = next > 255 ? 255 : next;
					dp[k][next] = min( dp[k][next], dp[k-1][i] + SQUARE( next - x[k] ) );
				}
			}
		}

		int answer = INF;
		for ( int i = 0; i < 256; i++ ) answer = min( answer, dp[n][i] );
		cout << answer << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>c,x;
#define MA 99999999
int dp[20002][20002];
int main(){
    int n,m,f,ans;
    
    while(true){
        cin >> n>>m;
        if(n==0)break;
        for(int i=0;i<20;i++)
            for(int j=0;j<20002;j++)
                dp[i][j]=MA;
        c.clear();
        x.clear();
        ans=MA;
        for(int i=0;i<m;i++){
            cin>>f;
            c.push_back(f);
        }
        for(int i=0;i<n;i++){
            cin>>f;
            x.push_back(f);
        }
        dp[0][128]=0;
        for(int i=0;i<m;i++){
        
            for(int j=0;j<256;j++){
                if(dp[i][j]==MA)
                    continue;
                for(int k=0;k<n;k++){
                    
                    int 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] +(x[i]-nex)*(x[i]-nex));
                   
                }
            }
        }
        for(int j=0;j<256;j++)ans=min(ans,dp[n][j]);
        cout<<ans<<endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif

int main(){
    while(true) {
        int n, m;
        cin >> n >> m;

        if(n == 0 and m == 0) break;

        vector<int> c(m), x(n);
        for (auto i = 0; i < m; i++) cin >> c[i];
        for (auto i = 0; i < n; i++) cin >> x[i];

        vector<vector<int64_t>> dp(n + 1, vector<int64_t>(256, INT64_MAX));
        dp[0][128] = 0;
        for (auto i = 0; i < n; i++) {
            for (auto j = 0; j < 256; j++) {
                for (auto k = 0; k < m; k++) {
                    if(dp[i][j] == INT64_MAX) continue;
                    auto y = max(min(j + c[k], 255), 0);
                    auto sum = (y - x[i]) * (y - x[i]);
                    dp[i + 1][y] = min(dp[i + 1][y], sum + dp[i][j]);
                }
            }
        }

//        for (auto i = 0; i <= n; i++) {
//            cout << i << " ";
//            for (auto j = 0; j < 256; j++) {
//                if(dp[i][j] != INT64_MAX) cout << j << " " << dp[i][j] << " ";
//            }
//            cout << endl;
//        }

        int64_t ans = INT64_MAX;
        for (auto i = 0; i < 256; i++) ans = min(ans, dp[n][i]);

        cout << ans << endl;
    }
    return 0;
}