#include <bits/stdc++.h>

using namespace std;

const int P = 1e9 + 7;

int n, m, val[15], ct[15], vis[1048576];
pair<int, int> f[1048576];
int pw[15][15];
vector<int> M[15][35];

int solve(int z, int x, int y, int s = 0) {
    if (z > m) return 0;
    if (z != 1 && ~M[z][x][s]) return M[z][x][s];
    int S = 0;
    for (int j = 0; j < val[z]; ++j) ct[j] = 0;
    for (int j = n - 1; ~j; --j) {
        if ((y >> j) & 1) {
            if (j == x) S = ct[j % val[z]];
            ++ct[j % val[z]];
        }
    }
    int tx = -1, ty = 0, ts = 0;
    for (int j = 0; j < n; ++j) {
        if (ct[j % val[z]]) {
            ty |= (1 << j), ts += pw[z][j % val[z]], --ct[j % val[z]];
            if (!~tx && x % val[z] == j % val[z] && !ct[j % val[z]]) tx = j;
        }
    }
    if (z != 1) M[z][x][s] = S + solve(z + 1, tx, ty, ts);
    return S + solve(z + 1, tx, ty, ts);
}

pair<int, int> calc(int x, int s) {
    if (x == ((1 << n) - 1)) return {0, 1};
    if (vis[s]++) return f[s];
    int mx = 0, sum = 0, usd = 0;
    for (int i = n - 1; ~i; --i) {
        if (((x >> i) & 1) || (usd >> (i % val[1])) & 1) continue;
        usd |= (1 << (i % val[1]));
        pair<int, int> ans = calc(x | (1 << i), s + pw[1][i % val[1]]);
        ans.first += solve(1, i, x | (1 << i));
        if (ans.first > mx) tie(mx, sum) = ans;
        else if (ans.first == mx) ((sum += ans.second) >= P) && (sum -= P);
    }
    return f[s] = {mx, sum};
}

signed main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; ++i) scanf("%d", &val[i]);
    for (int j = 1; j <= m; ++j) {
        for (int i = 0; i < val[j]; ++i) pw[j][i] = 1;
        for (int i = 0; i < n; ++i) ++pw[j][i % val[j]];
        for (int i = 1; i < val[j]; ++i) pw[j][i] = pw[j][i - 1] * pw[j][i];
        for (int i = 0; i < n; ++i) M[j + 1][i].resize(pw[j][val[j] - 1], -1);
        for (int i = val[j] - 1; ~i; --i) pw[j][i] = (!i ? 1 : pw[j][i - 1]);
    }
    printf("%d %d\n", calc(0, 0).first, calc(0, 0).second);
    return 0;
}