#include <iostream>
using namespace std;
int n, m, x[7], dp[10000009];
int solve(int mod) {
	dp[0] = 1;
	for (int i = 1; 2 * i - 2 < n; i++) {
		dp[i] = 0;
		for (int j = 0; j < m; j++) {
			if (i >= x[j]) {
				dp[i] += dp[i - x[j]];
				if (dp[i] >= mod) dp[i] -= mod;
			}
		}
	}
	int ret = 0;
	for (int i = 0; i < m; i++) {
		for (int j = 0; 2 * j < n; j++) {
			if (2 * (j + x[i]) >= n) {
				ret = (ret + 1LL * dp[j] * dp[n - j - x[i] - 1]) % mod;
			}
		}
	}
	return ret;
}
int binpow(int a, int b, int mod) {
	int ret = 1;
	while (b) {
		if (b & 1) ret = 1LL * ret * a % mod;
		a = 1LL * a * a % mod;
		b >>= 1;
	}
	return ret;
}
int main() {
	cin >> n >> m;
	for (int i = 0; i < m; i++) cin >> x[i];
	int part1 = 168647939;
	int part2 = 592951213;
	int res1 = solve(part1);
	int res2 = solve(part2);
	int subans = 1LL * (res2 - res1 + part2) * binpow(part1, part2 - 2, part2) % part2;
	long long ans = 1LL * subans * part1 + res1;
	cout << ans << '\n';
	return 0;
}