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++: ///
// File:  2199.cpp
// Author: ymiyamoto
//
// Created on Sat Dec  9 23:16:36 2017
//

#include <cstdint>
#include <iostream>
#include <vector>

#define MAX 1 << 25

using namespace std;

int32_t main()
{
  while (true) {
    uint32_t N, M;
    cin >> N >> M;
    if (N == 0 && M == 0) break;

    vector<int32_t> C(M);
    vector<int32_t> x(N + 1);

    for (uint32_t i = 0; i < M; i++) {
      cin >> C[i];
    }

    for (uint32_t i = 1; i <= N; i++) {
      cin >> x[i];
    }

    vector<vector<int32_t>> dp(N + 1, vector<int32_t>(256, MAX));
    dp[0][128] = 0;

    for (uint32_t i = 0; i < N; i++) {
      for (int32_t j = 0; j < 256; j++) {
        if (dp[i][j] == MAX) continue;
        for (uint32_t k = 0; k < C.size(); k++) {
          int32_t val = min(max(0, j + C[k]), 255);
          int32_t diff = (x[i + 1] - val);
          dp[i + 1][val] = min(dp[i + 1][val], dp[i][j] + diff * diff);
        }
      }
    }

    int32_t minval = MAX;
    for (int32_t i = 0; i < 256; i++) {
      minval = min(minval, dp[N][i]);
    }

    cout << minval << endl;
  }

  return 0;
}

C++: #include<stdio.h>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <functional>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <string>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <queue>
#include<iomanip>
#include<bitset>
#include<stack>
#include<set>
#include<limits>
#include <complex>
#include<cstdlib>
using namespace std;

bool isso(long long int a) {
	if (a == 1||a==0)return false;
	for (long long int i = 2; i*i <= a; ++i) {
		if ((a%i)) {
		}
		else {
			return false;
		}
	}
	return true;
}

struct edge {
	int from;
	int to;
	long double time;
};
struct aa {
	int now;
	long double time;
	bitset<8>tickets;
};

class Compare {
public:
	//keiroが昇順に並ぶ
	bool operator()(const aa&l, const aa&r) {
		return l.time> r.time;
	}
};

long long int powint(long long int a, long long int b) {
	assert(b >= 0);
	if (b == 0)return 1;
	if (b == 1)return a;
	long long int ans = 1;
	long long int aa = powint(a, b / 2);
	ans *= aa*aa;
	if (b % 2)ans *= a;
	return ans;
}

int fizznum[15] = { 0,0,1,1,1,2,2,2,3,3,3,4,4,4,4 };
int buzznum[15] = { 0,0,0,0,1,1,1,1,1,2,2,2,2,2,2 };
int fibunum[15] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1 };
long long int memo[18];

string makefb(long long int num) {
	string st;
	if (!(num % 3)) {
		st+=("Fizz");
	}
	if (!(num % 5)) {
		st+=("Buzz");
	}
	if (st.size() == 0) {
		st = to_string(num);
	}
	return st;
}

string getans(long long int rest, long long int from) {
	string ans;
	long long int now(from);
	while (1) {
		string ast(makefb(now));
		if (rest <= ast.size()) {
			ans+=(ast.substr(rest, int(ast.size() - rest)));
			rest = 0;
		}
		else {
			rest -= ast.size();
		}
		now++;
		if (ans.size() >= 20) {
			return ans.substr(0, 20);
		}
	}
}

long long int dp[20001][256];
int main() {
	while (1) {
		memset(dp, 9999999, sizeof(dp));
		int N, M; cin >> N >> M;
		if (!N)break;
		set<int>changes;
		for (int i = 0; i < M; ++i) {
			int c; cin >> c;
			changes.emplace(c);
		}
		vector<int>nums;
		for (int i = 0; i < N; ++i) {
			int x; cin >> x;
			nums.emplace_back(x);
		}
		
		dp[0][128] = 0;
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < 256; ++j) {
				for (auto it = changes.begin(); it != changes.end(); ++it) {
					long long int nextnum = max(0,min(255, j + (*it)));
					dp[i + 1][nextnum] = min(dp[i+1][nextnum],dp[i][j]+(nextnum - nums[i])*(nextnum - nums[i]));
				}
			}
		}
		long long int ans = 1e16;
		for (int j = 0; j < 256; ++j) {
			ans = min(ans, dp[N][j]);
		}
		cout << ans << endl;
	}
	
	return 0;
}

C++: #include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
using namespace std;
int main(){
  int INF=2000000000;
  int i,j,k,n,m,c[20],x[20010],dp[20010][260];
  while(1){
  scanf("%d %d\n",&n,&m);
    if(n==0 && m==0){
      break;
    }
  for(i=0;i<m;i++){
    scanf("%d\n",&c[i]);
  }
  for(i=0;i<n;i++){
    scanf("%d\n",&x[i]);
  }
  for(i=0;i<=n;i++){
    for(j=0;j<=255;j++){
      dp[i][j]=INF;
    }
  }
  dp[0][128]=0;
  for(i=0;i<n;i++){
    for(j=0;j<=255;j++){
      for(k=0;k<m;k++){
        int a;
        if(j+c[k]<0){
          a=0;
        }
        else if(j+c[k]>255){
          a=255;
        }
        else{
          a=j+c[k];
        }
        dp[i+1][a]=min(dp[i+1][a],dp[i][j]+(x[i]-a)*(x[i]-a));
      }
    }
  }
  int ans=2000000000;
  for(i=0;i<=255;i++){
    ans=min(ans,dp[n][i]);
  }
  printf("%d\n",ans);
  }
  return 0;
}