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++: //Yattazo! Watashiha-Yosen-tsuukashita! It's 460points/600points! OHO!!!!!
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int x[65600][256],n,m,y[65600],z[65600],d,minx;
int main(){
	while(true){
		minx=2000000000;
		for(int i=0;i<65536;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;
	}
}

C++: #include <iostream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
const lli INF = 1 << 30;
const int MAX_N = 21000;
const int MAX_M = 20;
lli table[MAX_N+1][256];
int x[MAX_N];
int book[MAX_M];
void db_print(int line[]){
  for(int i = 100; i < 200; ++i){
    cout << i << "[" << line[i] << "]" << endl;
  }
  cout << endl;
}
int main(){
  int N, M;
  while(true){
    cin >> N >> M;
    if((N|M) == 0){
      break;
    }
    for(int i = 0; i < M; ++i){
      cin >> book[i];
    }
    for(int i = 0; i < N; ++i){
      cin >> x[i];
    }
    for(int i = 0; i < N+1; ++i){
      for(int j = 0; j < 256; ++j){
	table[i][j] = INF;
      }
    }
    //fill_n((int *) table, (N+1) * 256, INF);
    table[0][128] = 0;
    for(int i = 0; i < N; ++i){
      //db_print(table[i]);
      for(int j = 0; j < 256; ++j){
	for(int b = 0; b < M; ++b){	  
	  int d = book[b];
	  if(0 <= j+d && j+d <= 255){
	    int t = (x[i] - (j+d)) * (x[i] - (j+d));
	    table[i+1][j+d] = min(table[i+1][j+d], table[i][j]+t);
	  }
	  if(j+d < 0){
	    int t = (x[i] - 0) * (x[i] - 0);
	    table[i+1][0] = min(table[i+1][0], table[i][j]+t);
	  }
	  if(j+d > 255){
	    int t = (x[i] - 255) * (x[i] - 255);
	    table[i+1][255] = min(table[i+1][255], table[i][j]+t);
	  }
	}
      }
    }
    //db_print(table[N]);
    lli ans = INF;
    for(int i = 0; i < 256; ++i){
      ans = min(ans, table[N][i]);
    }
    cout << ans << endl;
  }    
  return 0;
}

C++: #include <iostream>

using namespace std;

inline int normalize(int y) {
    return min(255, max(0, y));
}

inline int get_error(int y, int y0) {
    y -= y0;
    return y * y;
}

int solve(int n, int m, int c[], int x[]) {
    int min_error = -1;
    int errors[n + 1][256];
    for (int t = 0; t <= n; ++t) {
        for (int y = 0; y < 256; ++y) {
            errors[t][y] = -1;
        }
    }
    errors[0][128] = 0;
    for (int t = 0; t < n; ++t) {
        for (int y = 0; y < 256; ++y) {
            if (errors[t][y] < 0) {
                continue;
            }
            for (int i = 0; i < m; ++i) {
                int yn = normalize(y + c[i]);
                int e = errors[t][y] + get_error(yn, x[t]);
                if (errors[t + 1][yn] < 0 || e < errors[t + 1][yn]) {
                    errors[t + 1][yn] = e;
                }
            }
        }
    }
    for (int y = 0; y < 256; ++y) {
        if (errors[n][y] < 0) {
            continue;
        }
        if (min_error < 0 || errors[n][y] < min_error) {
            min_error = errors[n][y];
        }
    }
    return min_error;
}

int main() {
    int n, m;
    int c[16], x[20000];
    while (true) {
        cin >> n >> m;
        if (n == 0) {
            return 0;
        }
        for (int i = 0; i < m; ++i) {
            cin >> c[i];
        }
        for (int i = 0; i < n; ++i) {
            cin >> x[i];
        }
        cout << solve(n, m, c, x) << endl;
    }
}