import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    while (true) {
        int N, M;
        scan(N, M);

        if (N == 0 && M == 0) return;

        auto c = iota(M).map!(i => readln.chomp.to!int).array;
        auto x = iota(N).map!(i => readln.chomp.to!int).array;

        auto ans = solve(N, M, c, x);
        writeln(ans);
    }

}


int solve(int N, int M, int[] c, int[] x) {
    auto dp = new int[][](N + 1, 256);
    fillAll(dp, inf);
    dp[0][128] = 0;

    foreach (i ; 0 .. N) {
        foreach (j ; 0 .. 256) {
            foreach (k ; 0 .. M) {
                int y = clamp(j + c[k], 0, 255);
                chmin(dp[i + 1][y], dp[i][j] + (y - x[i])^^2);
            }
        }
    }

    debug {
        //writefln("%(%s\n%)", dp);
    }

    int ans = int.max;
    foreach (j ; 0 .. 256) {
        chmin(ans, dp[N][j]);
    }
    return ans;
}













void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

