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;

int main(){
    int n,m;
    while(cin>>n>>m){
        if(n==0 && m==0 ) break;
        long long c[m],x[n+1];
        for(int i=0;i<m;i++){
            cin>>c[i];
        }
        for(int i=1;i<=n;i++){
            cin>>x[i];
        }
        long long dp[n+1][256]={};
        long long INF=1e9;
        for(int j=0;j<=n;j++)for(int i=0;i<256;i++){
            dp[j][i]=INF;
        }
        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++){
                    if(j+c[k]>=0 && j+c[k]<256) dp[i][j+c[k]]=min(dp[i][j+c[k]],dp[i-1][j]+(x[i]-j-c[k])*(x[i]-j-c[k]));
                    else if(j+c[k]<0) dp[i][0]=min(dp[i][0],dp[i-1][j]+x[i]*x[i]);
                    else dp[i][255]=min(dp[i][255],dp[i-1][j]+(x[i]-255)*(x[i]-255));
                }
            }
        }
        long long ans=1e18;
        for(int i=0;i<256;i++) ans=min(ans,dp[n][i]);
        cout<<ans<<endl;
    }
    
}

C++: 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
using namespace std;

const int INF = 987654321;

int main(void)
{
	for (;;)
	{
		int n, m;
		cin >> n >> m;
		if (!n)break;
		vector<int>c;
		for (int i = 0; i < m; ++i)
		{
			int cc; cin >> cc;
			c.push_back(cc);
		}
		array<int, 256>dp;
		fill(dp.begin(), dp.end(), INF);
		dp[128] = 0;
		for (int i = 1; i <= n; ++i)
		{
			array<int, 256>ndp;
			fill(ndp.begin(), ndp.end(), INF);
			int x;
			cin >> x;
			for (int val = 0; val < 256; ++val)
			{
				if (val == 0)
				{
					int gap = -1;
					for (int ck : c)gap = max(gap, -ck);
					for (int old = 0; old <= gap; ++old)
					{
						ndp[val] = min(ndp[val], dp[old] + (x - val) * (x - val));
					}
				}
				else if (val == 255)
				{
					int gap = -1;
					for (int ck : c)gap = max(gap, ck);
					for (int old = 255 - gap; old < 256; ++old)
					{
						ndp[val] = min(ndp[val], dp[old] + (x - val) * (x - val));
					}
				}
				for (int ck : c)
				{
					int old = val - ck;
					if (old < 0)old = 0;
					if (old >= 256)old = 255;
					ndp[val] = min(ndp[val], dp[old] + (x - val) * (x - val));
				}
			}
			dp = ndp;
		}
		int ans = INF;
		for (int can : dp)
		{
			ans = min(ans, can);
		}
		cout << ans << endl;
	}
	return 0;
}

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

int table[20001][20][2] ;

main()
{
	int n,m,c[20],p[20001] ;
	
	while( cin >> n >> m , n )
	{
		for( int i=0 ; i<m ; i++ ) cin >> c[i] ;
		for( int i=0 ; i<n ; i++ ) cin >> p[i] ;
		
		for( int i=0 ; i<m ; i++ )
		{
			int y = 128 + c[i] ;
			if( y < 0 ) y = 0 ;
			else if( y > 255 ) y = 255 ;
			table[0][i][0] = y ;
			table[0][i][1] = pow( p[0]-table[0][i][0] , 2 ) ;
		}
		
		for( int i=1 ; i<n ; i++ )
		{
			for( int j=0 ; j<m ; j++ )
			{
				int y = table[i-1][j][0] + c[j] ;
				if( y < 0 ) y = 0 ;
				else if( y > 255 ) y = 255 ;
				
				int x = table[i-1][j][1] + pow( p[i]-y , 2 ) ;
				int y2 = y ;
				for( int k=0 ; k<m ; k++ )
				{
					if( j==k ) continue ;
					
					y = table[i-1][k][0] + c[j] ;
					if( y < 0 ) y = 0 ;
					else if( y > 255 ) y = 255 ;
					
					if( x > table[i-1][k][1] + pow( p[i]-y , 2 ) )
					{
						y2 = y ;
						x = table[i-1][k][1] + pow( p[i]-y2 , 2 ) ;
					}
				}
				table[i][j][0] = y2 ;
				table[i][j][1] = x ;
			}
		}
		
		int ans = table[n-1][0][1] ;
		for( int i=1 ; i<m ; i++ )
		{
			if( ans > table[n-1][i][1] ) ans = table[n-1][i][1] ;
		}
		
		cout << ans << endl ;
	}
}