#include <bits/stdc++.h>
template <class T>
bool chmax(T &a, const T &b) {
  return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  return (b < a) ? (a = b, 1) : 0;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf = 1LL << 60;
const ll mod = 1000000007LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll extgcd(ll a, ll b, ll &x, ll &y) {
  x = 1, y = 0;
  ll g = a;
  if (b != 0) g = extgcd(b, a % b, y, x), y -= a / b * x;
  return g;
}
ll ADD(const ll &a, const ll &b, const ll &mod) { return (a + b) % mod; }
ll SUB(const ll &a, const ll &b, const ll &mod) { return (a - b + mod) % mod; }
ll MUL(const ll &a, const ll &b, const ll &mod) { return (1LL * a * b) % mod; }
ll DIV(const ll &a, const ll &b, const ll &mod) {
  ll x, y;
  extgcd(b, mod, x, y);
  return MUL(a, (x + mod) % mod, mod);
}
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1, 6);
uniform_real_distribution<double> score(0.0, 10.0);
const int N = 256;
inline int round(int x) {
  chmin(x, N - 1);
  chmax(x, 0);
  return x;
}
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  for (int n, m; cin >> n >> m, n;) {
    vi C(m);
    for (auto &e : C) cin >> e;
    vi x(n);
    for (auto &e : x) cin >> e;
    vector<vll> dp(n + 1, vll(N, inf));
    dp[0][128] = 0;
    for (int i = (int)(0); i < (int)(n); ++i) {
      for (int j = (int)(0); j < (int)(N + 1); ++j) {
        ll cur = dp[i][j];
        if (dp[i][j] == inf) continue;
        for (auto &c : C) {
          int nj = round(j + c);
          chmin(dp[i + 1][nj], cur + (int)pow(nj - x[i], 2));
        }
      }
    }
    cout << *min_element(begin(dp[n]), end(dp[n])) << endl;
  }
  return 0;
}
