import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    rr = []

    while True:
        n,m = LI()
        if n == 0 and m == 0:
            break

        cs = [I() for _ in range(m)]
        xs = [I() for _ in range(n)]
        d = collections.defaultdict(int)
        d[128] = 0
        for x in xs:
            n = collections.defaultdict(lambda: inf)
            for k,v in d.items():
                for c in cs:
                    nk = max(min(k+c,255),0)
                    if n[nk] > v + (x-nk) ** 2:
                        n[nk] = v + (x-nk) ** 2
            d = n

        rr.append(min(d.values()))


    return '\n'.join(map(str, rr))


print(main())


