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++: #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>

using namespace std;
int C[16];
int x[20000];
int dp[20000][256];
int main(void){
  int N;
  int M;
  while(true){
    cin >> N >> M;
    if(N == 0 && 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] = INT_MAX;
      }
    }

    for(int i = 0; i < M; i++){
      int next_y = max(0, min(C[i] + 128, 255));
      dp[0][next_y] = min(dp[0][next_y], (next_y - x[0]) * (next_y - x[0]));
    }
    for(int i = 0; i < N - 1; i++){
      for(int j = 0; j < 256; j++){
        if(dp[i][j] != INT_MAX){
          for(int k = 0; k < M; k++){
            int next_y = max(0, min(C[k] + j, 255));
            dp[i + 1][next_y] = min(dp[i + 1][next_y], dp[i][j] + (next_y - x[i + 1]) * (next_y - x[i + 1]));
          }
        }
      }
    }
    int ans = INT_MAX;
    for(int i = 0; i < 256; i++){
      ans = min(ans, dp[N - 1][i]);
    }
    cout << ans << endl;
    }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;

int main()
{
    ll i,j,k;
    while(true){
        ll n,m;
        cin >> n >> m;
        if(n == 0 && m == 0) return 0;
        vector<ll> c(m);
        vector<ll> x(n);
        for(i = 0;i < m;++i){
            cin >> c.at(i);
        }
        for(i = 0;i < n;++i){
            cin >> x.at(i);
        }
        vector<vector<ll>> dp(n+1,vector<ll>(256,1e9));
        dp.at(0).at(128) = 0;
        for(i = 1;i <= n;++i){
            rep(j,256){
                rep(k,m){
                    ll tmp = j + c.at(k);
                    if(j + c.at(k) < 0) tmp = 0;
                    else if(j + c.at(k) > 255) tmp = 255;
                    dp.at(i).at(tmp) = min(dp.at(i).at(tmp), dp.at(i-1).at(j) + (tmp - x.at(i-1))*(tmp - x.at(i-1)));
                }
            }
        }
        ll ans = 1e9;
        for(i = 0;i < 256;++i){
            ans = min(ans, dp.at(n).at(i));
        }
        cout << ans << endl;
    }
    
    return 0;
}

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[20001][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]);
				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>
#define INF 1<<30
using namespace std;

int N,M;
int c[17];
int dp[20002][256];
int main(){
	int num,cost;
	while(cin >> N >> M){
		if(N == 0)break;
		for(int i = 0;i < M;i++){
			cin >> c[i];
		}
		for(int i = 0;i <= N;i++){
			for(int j = 0;j < 256;j++){
				dp[i][j] = INF;
			}
		}
			dp[0][128] = 0;
		for(int i = 0;i < N;i++){
			cin >> num;
			for(int j = 0;j <= 255;j++){
				if(dp[i][j] == INF)continue;
				for(int m = 0;m < M;m++){
					int x = j + c[m];
					if(x > 255)x = 255;
					else if(x < 0)x = 0;
					cost = (num-x)*(num-x);
					dp[i+1][x] = min(dp[i+1][x],dp[i][j] + cost);
				}
			}
		}
		cost = INF;
		for(int i = 0;i <= 255;i++){
			cost = min(cost,dp[N][i]);
		}
		cout << cost <<endl;
	}
	return 0;
}

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

using namespace std;

const int INF = 1<<30;

int n, m, data[16], dp[2][256], in;

main(){
  while(1){
    scanf("%d%d", &n, &m);
    if(!n && !m) break;
    for(int i=0;i<m;i++) scanf("%d", &data[i]);
    for(int i=0;i<256;i++) dp[0][i] = INF;
    dp[0][128] = 0;
    for(int i=0;i<n;i++){
      for(int j=0;j<256;j++) dp[(i+1)%2][j] = INF;
      scanf("%d", &in);
      for(int j=0;j<256;j++){
        if(dp[i%2][j] == INF) continue;
        for(int k=0;k<m;k++){
          int next = j + data[k];
          if(next < 0) next = 0;
          if(next > 255) next = 255;
          dp[(i+1)%2][next] = min(dp[(i+1)%2][next], abs(in-(next)) * abs(in-(next)) + dp[i%2][j]);
        }
      }
    }
    int ans = INF;
    for(int i=0;i<256;i++) ans = min(ans, dp[n%2][i]);
    printf("%d\n", ans);
  }
}