// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 10, P = 998244353;

LL n, a[N];
int m, C[N + 1][N + 1];

void inline add(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}

void inline prework(int n) {
	C[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		C[i][0] = 1;
		for (int j = 1; j <= i; j++)
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % P;
	}
}

int inline power(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % P;
		a = 1ll * a * a % P;
		b >>= 1;
	}
	return res;
}

int inline Co(int a, int b) {
	int ret = 1;
	for (int i = 1; i <= b; i++) {
		ret = 1ll * ret * (a - i + 1) % P * power(i, P - 2) % P;
	}
	return ret;
}

int inline calcS() {
	int ans = 0;
	for (int i = 0; i < (1 << m); i++) {
		int c = 0;
		LL sm = n;
		for (int j = 0; j < m; j++) {
			if (i >> j & 1) sm -= a[j] + 1, c++;
		}
		int v = 1;
		if (sm < 0) continue;
		v = Co((sm + m - 1) % P, m - 1); 
		if (c & 1) add(ans, P - v);
		else add(ans, v);
	}
	return ans;
}

int f[62][10][1 << N], cnt[1 << N];

int inline calcV() {
	for (int i = 1; i < (1 << m); i++)
		cnt[i] = cnt[i - (i & -i)] + 1;
	f[61][0][(1 << m) - 1] = 1;
	for (int i = 60; ~i; i--) {
		int V = 0;
		for (int j = 0; j < m; j++)
			if (a[j] >> i & 1) V |= 1 << j;
		for (int j = 0; j < m; j++) {
			for (int k = 0; k < (1 << m); k++) {
				if (!f[i + 1][j][k]) continue;
				int w = f[i + 1][j][k];
				//cout << V << " " << w << " " << i + 1 << " " << j << " " << k << endl;
				int Z = k & V;
				int sz = m, vz = 0;
				for (int u = 0; u < m; u++)
					if (k >> u & 1) sz--, vz += a[u] >> i & 1;
				for (int v = Z; ; v = (v - 1) & Z) {
					int nv = vz - cnt[v];
					//cout << v << "?cdd?" << vz << endl;
					for (int u = nv & 1; u <= sz; u += 2) {
						int nj = 2 * j - nv - u + (n >> i & 1);
						//cout << v << " " << u << "bab" << nj << endl;
						if (nj >= 0 && nj < m)
							add(f[i][nj][k ^ v], 1ll * w * C[sz][u] % P);
					}
					if (v == 0) break;
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < (1 << m); i++) add(ans, f[0][0][i]);
	return ans;
}

int main() {
	prework(10);
	read(n), read(m);
	for (int i = 0; i < m; i++) read(a[i]);
	int s = calcS();
	int v = calcV();
	s = (s - v + P) % P;
	printf("%d\n", s);
    return 0;
}