import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum LIM = 10^^6 + 10; void main() { auto lpf = iota(LIM).array; foreach (p; 2 .. LIM) { if (lpf[p] == p) { for (int n = 2 * p; n < LIM; n += p) { chmin(lpf[n], p); } } } auto fs = new long[LIM]; fs[1] = 1; foreach (n; 2 .. LIM) { const p = lpf[n]; int e; int nn = n; do { ++e; nn /= p; } while (nn % p == 0); if (nn == 1) { fs[n] = 1L * n / p * (1L * (p - 1) * e + p); } else { fs[n] = fs[n / nn] * fs[nn]; } } debug { writeln("fs = ", fs[0 .. 31]); } try { for (; ; ) { const N = readInt(); const M = readInt(); auto A = new int[M]; foreach (i; 0 .. M) { A[i] = readInt(); } long ans; foreach (i; 0 .. M) { ans += fs[A[i]] - A[i]; } writeln(ans); } } catch (EOFException e) { } }