def prime_number_list(n): 
    l = [2, 3]
    if n < 5 : return l 
    for i in range(5, n+1, 2):
        if all([0 if i % x == 0 else 1 for x in l]):
            l += [i]
    return l

def main():
    M = int(input())
    N = int(input())
    C = sorted(list(map(int, input().split())))
    p = set(prime_number_list(M))
    ans = M // min(C)
    q = [0]
    cnt = 0
    l = [0] * (M + sum(C))
    C_ = [C[0]]
    for i in range(1, len(C)):
        if all([0 if C[i] % x == 0 else 1 for x in C[:i]]):
            C_ += [C[i]]
    while q:
        cnt += 1
        s = set(filter(lambda x : x <= M, q))
        q = []
        for i in s:
            for j in C_:
                a = i + j
                q += [a]
                l[M - a] = cnt
    for i in range(M):
        if i+1 in p : ans += l[i+1]
    print(ans)

if __name__ == '__main__':
    main()