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;

int n, m, c[16], x[20000], table[20000][256];
const int INF = 2147483647;

int min(int a, int b){
    return a < b ? a : b;
}

int main(){
    cin >> n >> m;
    while( n != 0 || m != 0 ){
        int i;
        for(i = 0; i < m; i++){
            cin >> c[i];
        }
        for(i = 0; i < n; i++){
            cin >> x[i];
        }
        //dp
        for(i = 0; i <= n; i++){
            for(int j = 0; j < 256; j++){
                table[i][j] = INF;
            }
        }
        table[0][128] = 0;
        for(i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                for(int k = 0; k <= 255; k++){
                    if( table[i][k] < INF ){
                        int t = k + c[j];
                        if( t < 0 ) t = 0;
                        if( t > 255 ) t = 255;
                        int s = (t - x[i])*(t - x[i]);
                        table[i+1][t] = min(table[i][k] + s, table[i+1][t]);
                    }
                }
            }
            /*
            for(int j = 0; j < 256; j++){
                if( table[i][j] == INF){
                    cout << "INF ";
                }else{
                    cout << table[i][j] << ' ';
                }
            }
            */
        }
        int ans = INF;
        for(int i = 0; i <= 255; i++){
            if( table[n][i] >= INF ) continue;
            if( ans < 0 ) ans = table[n][i];
            ans = min(table[n][i], ans);
        }
        cout << ans << endl;
        cin >> n >> m;
    }
    return 0;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll inf =1LL << 62;


int main(void){
	int dp[2][256];
	int tar[20000];
	int d[16];
	const int  INF = 1 << 30;
	int n,m;
		while(cin >> n >> m,n|m){
		rep(i,m)
			cin >> d[i];
		rep(i,n)
			cin >> tar[i];
		rep(i,256){
			dp[0][i]=INF;
			dp[1][i]=INF;
		}
		dp[0][128]=0;
		rep(i,n){
			rep(j,256)rep(k,m){
				int next=j+d[k];
				next=max(next,0);
				next=min(next,255);
				int cost=(next-tar[i])*(next-tar[i]);
				dp[1][next]=min(dp[1][next],dp[0][j]+cost);
			}
			rep(j,256){
				dp[0][j]=dp[1][j];
				dp[1][j]=INF;
			}
		}
		int ans=INF;
		rep(i,256)
			ans=min(ans,dp[0][i]);
		cout << ans << endl;
	}
	return 0;
}