#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);
typedef long long ll;

int main() {
	for (int N, M; cin >> N >> M && (N || M); ) {
		int C[32];
		for (int m = 0; m < M; ++m) {
			cin >> C[m];
		}

		int dp[2][256];
		int front = 0;
		int back = 1;
		fill_n((int*)dp, sizeof(dp) / sizeof(dp[0][0]), INT_MAX / 2);
		dp[back][128] = 0;

		for (int n = 0; n < N; ++n) {
			fill(&dp[front][0], &dp[front][256], INT_MAX / 2);
			int x;
			cin >> x;

			for (int from = 0; from < 256; ++from) {
				for (int m = 0; m < M; ++m) {
					int xx = from + C[m];
					if (256 <= xx) {
						xx = 255;
					}
					if (xx < 0) {
						xx = 0;
					}

					const int cost = (xx - x) * (xx - x);

					dp[front][xx] = min(dp[front][xx], dp[back][from] + cost);
				}
			}

			swap(front, back);
		}

		const int answer = *min_element(&dp[back][0], &dp[back][256]);
		cout << answer << endl;
	}
}