#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <cstring>
#include <algorithm>
#include <map>
#include <stack>
#include <random>
#include <bitset>
#include <list>
#include <assert.h>
#include <unordered_map>
// #define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 30, M = 11, stc = 3100000, bs = (1 << 16) - 1, mod = 998244353;
int tot, d[M];
int t0, sts[stc];
unordered_map<int, int> m1;// (S, 轮数)
unordered_map<ll, int> m2;
int n, m, orr[M][M], pre[M][N];
int nxt[stc];
int dp[1 << 20][2];
short cost[stc][N];
// cost[S][i][j] S i~m 轮在 j
int id;
int ppc[1 << 16];
inline int popc(int x) {
    return ppc[x & bs] + ppc[x >> 16];
}
void dfs(int p, int now) {
    if (p >= d[id]) {
        m2[(1ll * now) << 4 | id] = ++tot;
        if (!id)
            sts[++t0] = now;
        int res = (1 << n) - 1;
        for (int i = 0; i < d[id + 1]; i++) {
            int cnt = 0;
            for (int j = i; j < n; j += d[id + 1]) {
                cnt += !(now & (1 << j));
            }
            for (int j = 0; j < cnt; j++) {
                res ^= (1 << (i + j * d[id + 1]));
            }
        }
        nxt[tot] = res;
        return ;
    }
    dfs(p + 1, now);
    for (int i = p; i < n; i += d[id]) {
        now ^= (1 << i);
        dfs(p + 1, now);
    }
}
short calc(int s, int i, int j/*pos*/) {
    // assert(!((s >> j) & 1));
    // assert(i >= 0 && i < 16);
    if (i >= m)
        return 0;
    int k = m2[(1ll * s) << 4 | i];
    // assert(j >= 0);
    // cerr << (k << 6 | j) << ' ' << k * 64 + j << "!\n";
    // assert(s <= stc);
    if (~cost[k][j])
        return cost[k][j];
    int to = nxt[k];
    // cerr << s << ' ' << i << ' ' << k << ' ' <<j << ' ' << to << ' ' << d[i + 1] << ' ' << orr[i + 1][j % d[i + 1]] << ' ' << to << ' ' << (to ^ ((1 << n) - 1)) << "|\n";
    return cost[k][j] = calc(to, i + 1, j % d[i + 1] + d[i + 1] * (popc((to ^ ((1 << n) - 1)) & orr[i + 1][j % d[i + 1]]) - 1)) + popc(s & pre[i + 1][j]);
}
signed main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= bs; i++)
        ppc[i] = ppc[i ^ (i & -i)] + 1;
    for (int i = 1; i <= m; i++) {
        scanf("%d", &d[i]);
        for (int j = 0; j < n; j++) {
            orr[i][j % d[i]] |= (1 << j);
            pre[i][j] = ((j >= d[i] ? pre[i][j - d[i]] : 0) | (1 << j));
        }
    }
    clock_t fi, st = clock();
    d[id = 0] = d[1];
    dfs(0, 0);
    for (int i = 1; i <= m; i++) {
        id = i;
        dfs(0, (1 << n) - 1);
    }
    memset(cost, -1, sizeof(cost));
    sort(sts + 1, sts + t0 + 1);
    for (int sti = 1; sti <= t0; sti++)
        m1[sts[sti]] = sti;
    dp[m1[0]][1] = 1;
    // cerr << tot << ' ' << t0 << "!\n";
    for (int sti = 1; sti < t0; sti++) {
        int i = sts[sti];
        // cout << sti << ' ' << i << ' ' << dp[sti][0] << ' ' << dp[sti][1] << "!\n";
        for (int j = 0; j < n; j++) {
            if ((i >> j) & 1)
                continue;
            int to = (i | (1 << j));
            if (m1.count(to)) {
                to = m1[to];
                // assert(!((i >> j) & 1));
                int v = dp[sti][0] + calc(i, 0, j);
                // cout << j << ' ' << to << ' ' << v << "?\n";
                if (dp[to][0] < v) {
                    dp[to][0] = v;
                    dp[to][1] = dp[sti][1];
                } else if (dp[to][0] == v)
                    dp[to][1] = (dp[to][1] + dp[sti][1]) % mod;
            }
        }
    }
    // cerr << m3.size() << '\n';
    int ed = m1[(1 << n) - 1];
    printf("%d %d\n", dp[ed][0], dp[ed][1]);
    fi = clock();
    cerr << (double)(fi - st) / CLOCKS_PER_SEC;
    return 0;
}