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 <cstdio>
#include <vector>
#include <string>
#include <deque>
#include <memory.h>

#define rep(idx, max)			for(int idx = 0, idx##Max = (max); idx < idx##Max; idx ++)
#define rrep(idx, min, max)	for(int idx = (min), idx##Max = max; idx < idx##Max; idx ++)
#define erep(idx, min, max)	for(int idx = (min), idx##Max = max; idx <= idx##Max; idx ++)
#define rev(idx, max)			for(int idx = (max) - 1; idx >= 0; idx --)
#define rrev(idx, min, max)	for(int idx = (max) - 1, idx##Min = (min); idx >= idx##Min; idx --)
#define erev(idx, min, max)	for(int idx = (max), idx##Min = (min); idx >= idx##Min; idx --)
#define foreach(it, obj)	for(auto it = obj.begin(), it##End = obj.end(); it >= it##End; it ++)
#define CLIP(x, min_, max_)	std::max(min_, std::min(max_, x))

using namespace	std;

typedef std::vector<int>	VEC;

VEC	g_signal;
VEC	g_codeBook;

#define	MAX_SIG_LEN	32768
#define	MAX_CB_LEN	32
#define	MAX_MOD_VAL	256

inline int Pow2i(int x)	{	return(x * x);	}
int	Solve()
{
	static	int	cache[MAX_SIG_LEN][MAX_MOD_VAL];
	
	::memset(cache, 0x7F, sizeof(cache));	// Fill chache with '0x7F', thus all element of 'cache' will be 0x7F7F7F7F.
	cache[0][128]	= 0;
	
	rep(i, g_signal.size())
	{
		rep(y, MAX_MOD_VAL)
		{
			if(cache[i][y] == 0x7F7F7F7F)	{	continue;	}
			rep(k, g_codeBook.size())
			{
				int yn = CLIP(y + g_codeBook[k], 0, 255);
				cache[i + 1][yn]	= min(cache[i + 1][yn], cache[i][y] + ::Pow2i(g_signal[i] - yn));
			//	::printf("y: %d, cb: %d, yn: %d, c_{i}: %d, c_{i+1}: %d\n", y, g_codeBook[k], yn, cache[i][y], cache[i + 1][yn]);
			}
			//::puts("");
		}
	}
	return(*min_element(cache[g_signal.size()], cache[g_signal.size()] + MAX_MOD_VAL));
}

int main()
{
	int sigLen, cbLen;
	while(cin >> sigLen >> cbLen, sigLen)
	{
		g_codeBook.resize(cbLen);
		g_signal.resize(sigLen);
		rep(i, g_codeBook.size())	{	cin >> g_codeBook[i];	}
		rep(i, g_signal.size())	{	cin >> g_signal[i];	}
		::printf("%d\n", ::Solve());
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <climits>
#include <cstddef>

uint64_t dp[20001][256];
//     ^???????????????????????????i
//            ^y_i??????

int round(int x) {
  if (x < 0) {
    return 0;
  }
  if (x > 255) {
    return 255;
  }
  return x;
}

int main() {
  int N, M;
  while (std::cin >> N >> M) {
    if (N == 0 && M == 0) {
      break;
    }
    std::vector<int> x(N);
    std::vector<int> C(M);
    for (int i = 0; i < M; i++) {
      std::cin >> C[i];
    }
    for (int i = 0; i < N; i++) {
      std::cin >> x[i];
    }

    uint64_t inf = 1ull << 30;
    for(int i = 0; i < N + 1; i++) {
      for (int j = 0; j < 256; j++) {
        dp[i][j] = inf;
      }
    }
    dp[0][128] = 0;

    for (int i = 0; i < N; i++) {
      for (int j = 0; j < 256; j++) {
        if (dp[i][j] == inf) {
          continue;
        }

        for(auto c : C) {
          int y = round(j + c);
          int diff = x[i] - y;
          int new_value = dp[i][j] + diff * diff;
          if (new_value < dp[i + 1][y]) {
            dp[i + 1][y] = new_value;
          }
        }
      }
    }

    int min = inf;
    for (int j = 0; j < 256; j++) {
      if (dp[N][j] < min) {
        min = dp[N][j];
      }
    }
    std::cout << min << std::endl;
  }
}

C++: #include <iostream>

using namespace std;

const int INF = 100000000;
#define P(x) (x) * (x)

int dp[20050][260];

int main(void)
{
	int n, m;
	while (cin >> n >> m, n && m){
		int c[20];
		int x[20050];
		for (int i = 0; i < m; i++){
			cin >> c[i];
		}
		for (int i = 0; i < n; i++){
			cin >> x[i];
		}

		// memset(dp, INF, sizeof(dp));
		for (int i = 0; i < 20050; i++){
			for (int j = 0; j < 260; j++){
				dp[i][j] = INF;
			}
		}

		dp[0][128] = 0;
		for (int i = 0; i < n; i++){
			for (int j = 0; j < 256; j++){
				if (dp[i][j] == INF) continue;
				for (int k = 0; k < m; k++){
					int now = j + c[k];
					if (now < 0) now = 0;
					if (255 < now) now = 255;
					dp[i + 1][now] = min(dp[i + 1][now], dp[i][j] + P(x[i] - now));
					// cout << P(c[i + 1] - now) << " ";
					// printf("dp[%d][%d] = %d\n", i+1, now, dp[i+1][now]);
				}
				// puts("");
			}
		}

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

		cout << ret << endl;
	}
}