#include <bits/stdc++.h>
using namespace std;

namespace SOL {

using i64 = long long;
void debug(const char *msg, ...) {
#ifdef CLESIP
    va_list arg;
    static char pbString[512];
    va_start(arg,msg);
    vsprintf(pbString,msg,arg);
    cerr << "[DEBUG] " << pbString << "\n";
    va_end(arg);
#endif    
}
template<typename T, typename L>
bool chkmax(T &x, L y) { if (x < y) return x = y, true; return false; }
template<typename T, typename L>
bool chkmin(T &x, L y) { if (y < x) return x = y, true; return false; }

const int N = 30;
const int M = 10;
const int K = 1.1e6;
const i64 P = 1e9 + 7;
int n, m, d[M], pw[M + 1], cnt[N], a[M], mask[M][M];

struct Node {
	i64 sum, cnt;
} f[K];

void mod(i64 &x, i64 y) {
	x += y;
	if (x >= P)
		x -= P;
}

void trans(Node &lhs, const Node &rhs, int cost) {
	if (lhs.cnt == rhs.cnt + cost)
		mod(lhs.sum, rhs.sum);
	else if (lhs.cnt < rhs.cnt + cost)
		lhs = { rhs.sum, rhs.cnt + cost };
}

int gen_mask(int p, int q, int cnt) {
	return mask[p][q] & ((1 << min(30, cnt * d[p])) - 1);
}

void solve() {
	cin >> n >> m;
	for (int i = 0; i < m; i ++) {
		cin >> d[i];
		for (int j = 0; j < n; j ++)
			mask[i][j % d[i]] |= (1 << j);
	}
	for (int i = 0; i < n; i ++)
		cnt[i % d[0]] ++;
	pw[0] = 1;
	for (int i = 1; i <= d[0]; i ++)
		pw[i] = pw[i - 1] * (cnt[i - 1] + 1);
	// debug("pw[%d] = %d", d[0], pw[d[0]]);
	f[0].sum = 1;
	for (int S = 0; S < pw[d[0]]; S ++) {
		// debug("S: %d", S);
		for (int i = 0; i < d[0]; i ++)
			a[i] = (S / pw[i]) % (cnt[i] + 1);
		for (int i = 0; i < d[0]; i ++) if (a[i] < cnt[i]) {
			int cost = cnt[i] - a[i] - 1, pos = i + (cnt[i] - a[i] - 1) * d[0], T = 0;
			for (int j = 0; j < d[0]; j ++)
				T |= gen_mask(0, j, cnt[j] - a[j] - (i == j));
			for (int j = 1; j < m; j ++) {
				int q = pos % d[j]; 
				cost += __builtin_popcount((T & mask[j][q]) >> pos);
				pos = q + __builtin_popcount(T & mask[j][q]) * d[j];
				int nxt = 0;
				for (int k = 0; k < d[j]; k ++)
					nxt |= gen_mask(j, k, __builtin_popcount(T & mask[j][k]));
				T = nxt;
			}
			// debug("i: %d cost: %d", i, cost);
			trans(f[S + pw[i]], f[S], cost);
		}
	}
	cout << f[pw[d[0]] - 1].cnt % P << " " << f[pw[d[0]] - 1].sum << "\n";
}

}
int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	SOL::solve();
	return 0;
}