//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

typedef long long ll;
typedef long double ld;
const int maxN = 35;
const int maxM = 15;
int n, m;
int d[maxM];
const int mod = (int)1e9 + 7;
int sum(int a, int b) {
    int s = a + b;
    if (s >= mod) s -= mod;
    return s;
}
int sub(int a, int b) {
    int s = a - b;
    if (s < 0) s += mod;
    return s;
}
int mult(int a, int b) {
    return (1LL * a * b) % mod;
}
int ini_array[maxN];
int cnt_chain[15];
int after[maxM][maxN];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> d[i];
    }
    vector<vector<int>> chains(d[0]);
    for (int z = 0; z < d[0]; z++) {
        for (int x = z; x < n; x += d[0]) {
            chains[z].emplace_back(x);
        }
    }
    int add = 0;
    for (int x = 0; x < d[0]; x++) {
        add += (chains[x].size() * (chains[x].size() - 1)) / 2;
    }
//    cout << add << " ????? " << endl;
    int states = 1;
    for (int x = 0; x < d[0]; x++) {
        states *= (chains[x].size() + 1);
    }
//    cout << states << " ??? " << endl;
    vector<pair<int,int>> P(states, make_pair(-1, 0));
    vector<int> suf_prod(d[0]);
    suf_prod[0] = 1;
    for (int i = 1; i < d[0]; i++) {
        suf_prod[i] = suf_prod[i - 1] * (chains[i - 1].size() + 1);
    }
    P[0] = {add, 1};
//    cout << " gg " << endl;
    for (int i = 0; i < states; i++) {
        int cur = i;
        for (int x = 0; x < d[0]; x++) {
            cnt_chain[x] = (cur % (chains[x].size() + 1));
            cur /= (chains[x].size() + 1);
        }
        for (int u = 0; u < d[0]; u++) {
            for (int g = 0; g < cnt_chain[u]; g++) {
//                ini_array[chains[u][g]] = 0;
                after[0][chains[u][g]] = 0;
            }
            for (int g = cnt_chain[u]; g < (int)chains[u].size(); g++) {
//                ini_array[chains[u][g]] = 2;
                after[0][chains[u][g]] = 2;
            }
        }
        for (int u = 1; u < m; u++) {
            int f = d[u];
            for (int z = 0; z < n; z++) after[u][z] = after[u - 1][z];
            for (int x = 0; x < f; x++) {
                for (int Y = x; Y < n; Y += f) {
                    for (int Z = Y + f; Z < n; Z += f) {
                        if (after[u][Y] > after[u][Z]) {
                            swap(after[u][Y], after[u][Z]);
                        }
                    }
                }
            }
        }
        for (int x = 0; x < d[0]; x++) {
            if (cnt_chain[x] < (int)chains[x].size()) {
                /*for (int u = 0; u < d[0]; u++) {
                    for (int g = 0; g < cnt_chain[u]; g++) {
                        ini_array[chains[u][g]] = 0;
                    }
                    for (int g = cnt_chain[u]; g < (int)chains[u].size(); g++) {
                        ini_array[chains[u][g]] = 2;
                    }
                }*/
//                ini_array[chains[x][cnt_chain[x]]] = 1;
                int new_state = suf_prod[x] + i;
                int T = 0;
                int WHERE = chains[x][cnt_chain[x]];
                for (int u = 1; u < m; u++) {
                    int f = d[u];
                    /*for (int p = 0; p < f; p++) {
                        for (int X = p; X < n; X += f) {
                            for (int Y = X + f; Y < n; Y += f) {
                                if (ini_array[X] > ini_array[Y]) {
                                    if (ini_array[X] == 1 && ini_array[Y] == 0) {
                                        T += 1;
                                    }
                                    swap(ini_array[X], ini_array[Y]);
                                }
                            }
                        }
                    }*/

                    for (int p = WHERE + f; p < n; p += f) {
                        if (after[u - 1][p] == 0) T += 1;
                    }

                    int S = WHERE % f;
                    int qq = 0;
                    for (int X = S; X < n; X += f) {
                        if (after[u][X] == 0) qq += 1;
                    }
                    WHERE = qq * f + S;
//                    for (int z = S; z < n; z += f) {
//                        cout << after[u][z] << " ";
//                    }
//                    cout << endl;
//                    assert(WHERE < n);
                }
                if (P[new_state].first < P[i].first + T) {
                    P[new_state] = {P[i].first + T, P[i].second};
                }
                else if (P[new_state].first == P[i].first + T) {
                    P[new_state].second = sum(P[new_state].second, P[i].second);
                }
            }
        }
    }
    cout << P.back().first << " " << P.back().second << '\n';
    return 0;
}