#include <bits/stdc++.h>
#define add(x, y) x = (x + y) % Mo
#define get(x, y, r) x / prod[r][y] % (lim[r][y] + 1)
const int M = 11, Mo = 1e9 + 7;
int n, m, d[M], lim[M][10], prod[M][11], a[30];
std::vector<int> f, cnt; std::vector<std::vector<int>> dp[M];
int DP(int r, int p, int mask) {
  if (r == m) return 0;
  if (dp[r][p][mask] != -1) return dp[r][p][mask];
  for (int i = 0; i < d[r]; ++i) {
    int x = get(mask, i, r);
    for (int j = i; j < n; j += d[r], --x)
      if (x > 0) a[j] = -1;
      else if (i == p && x == 0) a[j] = 0;
      else a[j] = 1;
  }
  dp[r][p][mask] = 0; int nxtP = -1, nxtMask = 0;
  for (int i = 0; i < d[r + 1]; ++i) {
    int buc[3] = {0};
    for (int j = i; j < n; j += d[r + 1]) {
      ++buc[a[j] + 1]; if (a[j] == -1 && buc[1]) ++dp[r][p][mask];
    }
    if (buc[1]) nxtP = i;
    nxtMask += buc[0] * prod[r + 1][i];
  }
  dp[r][p][mask] += DP(r + 1, nxtP, nxtMask);
  return dp[r][p][mask];
}
int main() {
  scanf("%d%d", &n, &m); int delta = 0;
  for (int r = 1; r <= m; ++r) {
    scanf("%d", &d[r]);
    for (int i = 0; i < n; ++i) {
      if (r == 1) delta += lim[1][i % d[r]];
      ++lim[r][i % d[r]];
    }
    prod[r][0] = 1;
    for (int i = 0; i < d[r]; ++i)
      prod[r][i + 1] = prod[r][i] * (lim[r][i] + 1);
    dp[r].resize(d[r], std::vector<int>(prod[r][d[r]], -1));
  }
  f.resize(prod[1][d[1]]), cnt.resize(prod[1][d[1]]), cnt[0] = 1;
  for (int mask = 0; mask < prod[1][d[1]]; ++mask)
    for (int i = 0; i < d[1]; ++i) {
      int x = get(mask, i, 1);
      if (x == lim[1][i]) continue;
      int nxtMask = mask + prod[1][i], swapCount = DP(1, i, mask);
      if (f[mask] + swapCount > f[nxtMask])
        f[nxtMask] = f[mask] + swapCount, cnt[nxtMask] = cnt[mask];
      else if (f[mask] + swapCount == f[nxtMask])
        add(cnt[nxtMask], cnt[mask]);
    }
  printf("%d %d", delta + f[prod[1][d[1]] - 1], cnt[prod[1][d[1]] - 1]);
  return 0;
}