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<algorithm>
#include<cmath>
#define inf (1<<29)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int N,M;
int C[17];
int x[20010];
int dp[20010][256];

int main()
{
  while(cin >> N >> M,N|M)
    {
      REP(i,1,M+1)cin >> C[i];
      REP(i,1,N+1)cin >> x[i];
      rep(i,20010)rep(j,256)dp[i][j] = inf;
      dp[0][128] = 0;

      rep(i,N+1)
	{
	  REP(j,1,M+1)
	    {
	      rep(k,256)
		{
		  if(dp[i][k] == inf)continue;
		  int value = k+C[j];
		  if(value < 0)value = 0;
		  else if(value > 255)value = 255;
		  dp[i+1][value] = min(dp[i+1][value],
				       dp[i][k]+(x[i+1]-value)*(x[i+1]-value));
		}
	    }
	}

      int men = inf;
      rep(i,256)men = min(men,dp[N][i]);
      cout << men << endl;
    }
  return 0;
}

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

using namespace std;

const int INF = 1<<29;

int main(){
  int n, m;
  while(cin >> n >> m && (n|m)){
    vector<int> C(m);
    for(int i=0; i<m; i++) cin >> C[i];
    
    vector<int> dp(256, INF);
    dp[128] = 0;
    while(n--) {
      vector<int> next(256, INF);
      int in; cin >> in;
      for(int i=0; i<=255; i++){
	if(dp[i] < INF) {
	  for(int j=0; j<m; j++){
	    int now = i + C[j];
	    if(now < 0)   { now = 0;   }
	    if(now > 255) { now = 255; }
	    int diff = (in - now) * (in - now);
	    next[now] = min(next[now], dp[i] + diff );
	  }
	}
      }
      dp = next;
    }
    
    cout << *min_element(dp.begin(), dp.end()) << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)

const int inf = ( 1 << 28);

int dp[20001][256];
int solve(int n,int m,int *cbook,int *in){
  rep(i,n+1)rep(j,256)dp[i][j]=inf;
  dp[0][128]=0;

  rep(i,n){
    rep(j,256){
      if (dp[i][j] == inf)continue;
      rep(k,m){
	int next=j+cbook[k];
	if (next<0)next=0;
	else if (next>255)next=255;
	dp[i+1][next]=min(dp[i+1][next],dp[i][j]+(next-in[i])*(next-in[i]));
      }
    }
  }
  
  int ans = inf;
  rep(i,256)ans=min(ans,dp[n][i]);
  return ans;
}


main(){
  int n,m;
  int in[20000],cbook[200];
  while(cin>>n>>m && n){
    rep(i,m)cin>>cbook[i];
    rep(i,n)cin>>in[i];
    cout << solve(n,m,cbook,in) << endl;
  }
}

C++: #include<iostream>
#include<algorithm>

using namespace std;
typedef long long ll;

ll c[16], x[20000];

ll dp[20001][256];

int main() {
	while (1) {
		int n, m;
		cin >> n >> m;
		if (n + m == 0)break;
		for (int i = 0; i < m; i++)cin >> c[i];
		for (int i = 0; i < n; i++)cin >> x[i];

		for (int i = 0; i < n; i++)for (int j = 0; j < 256; j++)dp[i][j] = 1e18;
		dp[0][128] = 0;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j <= 255; j++) {
				for (int k = 0; k < m; k++) {
					ll nxt = 0;
					nxt = j + c[k];
					if (nxt < 0)nxt = 0;
					if (nxt > 255)nxt = 255;
					
					dp[i + 1][nxt] = min(dp[i + 1][nxt], dp[i][j] + (x[i] - nxt) * (x[i] - nxt));
				}
			}
		}
		ll ans = 1e18;

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

	}

	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

typedef long long int lli;
int c[30],x[30000];
lli dp[30000][256];

int sq(int x) {
    return x*x;
}
int add(int x, int y) {
    return max(0, min(255, x+y));
}
int main(void) {
    while(1) {
        int n,m;
        scanf("%d%d",&n,&m);
        if(!n) break;
        memset(dp, 0x3F, sizeof(dp));

        for(int i=0; i<m; i++)
            scanf("%d",&c[i]);
        for(int i=0; i<n; i++)
            scanf("%d",&x[i]);

        dp[0][128] = 0;

        for(int i=0; i<n; i++)
            for(int j=0; j<256; j++)
                for(int k=0; k<m; k++)
                    dp[i+1][add(j,c[k])] = min(dp[i+1][add(j,c[k])], dp[i][j] + sq(x[i]-add(j,c[k])));

        lli res=0xFFFFFFFFFFFF;
        for(int j=0; j<256; j++)
            res = min(res, dp[n][j]);

        printf("%lld\n", res);

    }
    return 0;
}

C++: #include<iostream>

using namespace std;

const int inf=1<<28;

#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)

int n,m;
int c[16];
int x[20010];
int dp[20010][256];


int main(void){
	
	while(cin >> n >> m,n|m){
		rep(i,n+1)rep(j,256) dp[i][j]=inf;
		rep(i,m) cin >> c[i];
		rep(i,n) cin >> x[i];
		dp[0][128]=0;			
		rep(i,n)rep(j,256)rep(k,m){
			int next=j+c[k];
			if(next<0)next=0;
			if(next>255) next=255;
			dp[i+1][next]=min(dp[i+1][next],dp[i][j]+(next-x[i])*(next-x[i]));
		}
		int ans=inf;
		rep(i,256) ans=min(ans,dp[n][i]);
		cout << ans << endl;
	}
	return 0;

}