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>
 
using namespace std;

using usize = ::std::size_t;
//using u64 = ::std::uint_least64_t;
using u64 = long long;


int main(int argc, char *argv[])
{
    
 
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
    
    u64 N, M;
    
    while (cin >> N >> M, N >0 && M>0) {
        
        vector<vector<u64>> dp(N + 1, vector<u64>(256, Inf));
        vector<u64> c(M+1), x(N+1);
        
        for (int i = 1; i <= M; i++) {
            cin >> c[i];
        }
        for (int i = 1; i <= N; i++) {
            cin >> x[i];
        }
        dp[0][128] = 0;
        
        
        for (int i = 1; i <= N; i++) {
            for (int j = 0; j <= 255; j++) {
                for (int k = 1; k <= M; k++) {
                    if (j == 0) {
                        for (int jj = 0; jj <= -c[k]; jj++) {
                            if (dp[i - 1][jj] == Inf) {
                                continue;
                            }
                            dp[i][j] = min(dp[i][j], dp[i - 1][jj] + (x[i] - j)*(x[i] - j));
                        }
                    } else if (j == 255){
                        for (u64 jj = 255 - c[k]; jj <= 255; jj++) {
                            if (dp[i - 1][jj] == Inf) {
                                continue;
                            }
                            dp[i][j] = min(dp[i][j], dp[i - 1][jj] + (x[i] - j)*(x[i] - j));
                        }
                    } else if (j - c[k] >= 0 && j - c[k] <= 255) {
                        u64 jj = j - c[k];
                        if (dp[i - 1][jj] == Inf) {
                            continue;
                        }
                        dp[i][j] = min(dp[i][j], dp[i - 1][jj] + (x[i] - j)*(x[i] - j));
                    }
                }
            }
        }
        
        u64 min_dif = Inf;
        for (int i = 0; i <= 255; i++) {
            min_dif = min(min_dif, dp[N][i]);
        }
        cout << min_dif << endl;
    }
    
    
    return 0;
}

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

const int INF = 1 << 28;

int main ()
{
    int n, m;
    while (cin >> n >> m, n || m) {
        vector<vector<int> > dp(n + 1, vector<int>(256, INF));

        vector<int> c(m);
        vector<int> x(n);

        for (auto &i : c) cin >> i;
        for (auto &i : x) cin >> i;

        dp[0][128] = 0;

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < 256; j++) {
                for (int k = 0; k < m; k++) {
                    int pre = j + c[k];
                    if (pre > 255) pre = 255;
                    if (pre < 0) pre = 0;

                    dp[i][pre] = min(dp[i][pre], dp[i-1][j] + (pre - x[i-1]) * (pre - x[i-1]));
                }
            }
        }

        int res = INF;
        for (int i = 0; i < 256; i++) {
            res = min(res, dp[n][i]);
        }

        cout << res << endl;
    }

    return 0;
}

C++: #include<iostream>
#include<algorithm>
#define NUM 256
using namespace std;

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int dp[3000][NUM];
    for(int i=0;i<=n;i++)
      for(int j=0;j<NUM;j++)
	dp[i][j]=1<<30;
    dp[0][128]=0;
    int c[m],x[n];
    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<NUM;j++){
	for(int k=0;k<m;k++){
	  if(j+c[k]<0){
	    dp[i+1][0]=min(dp[i+1][0],dp[i][j] + x[i]*x[i]);
	  }else if(j+c[k]>255){
	    dp[i+1][255]=min(dp[i+1][255],dp[i][j] + (x[i]-255)*(x[i]-255));
	  }else{
	    dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j] + (x[i]-j-c[k])*(x[i]-j-c[k]));
	  }
	}
      }
    }
    // for(int j=0;j<256;j++){
    //   for(int i=0;i<n;i++){
    // 	cout << dp[i][j] << " ";
    //   }
    //   cout << endl;
    // }

    int res=1<<30;
    for(int i=0;i<NUM;i++)res=min(res,dp[n][i]);
    cout << res << endl;
  }
  return 0;
}