#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);i++)
#define drep(i,a,b) for (register int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

const int mod=998244353;
inline int qmo(int x){return x+((x>>31)&mod);}
inline int add(int x,int y){return qmo(x+y-mod);}
inline int sub(int x,int y){return qmo(x-y);}
inline void inc(int &x,int y){x=add(x,y);}
inline void dec(int &x,int y){x=sub(x,y);}
inline int quick_pow(int x,int k){int res=1; for (;k;k>>=1,x=1ll*x*x%mod) if (k&1) res=1ll*res*x%mod; return res;} 

const int N=200010;

int fac[N],_fac[N],inv[N],pc[N],pw[N];
inline void init(int size)
{
	*fac=*_fac=*inv=*pw=1;
	rep(i,1,size) fac[i]=1ll*fac[i-1]*i%mod;
	_fac[size]=quick_pow(fac[size],mod-2);
	drep(i,size-1,1) _fac[i]=1ll*_fac[i+1]*(i+1)%mod;
	rep(i,1,size) inv[i]=1ll*fac[i-1]*_fac[i]%mod;
	rep(i,1,size) pw[i]=qmo(-pw[i-1]);
	rep(i,1,size) pc[i]=pc[i>>1]+(i&1);
}
inline int C(int n,int m){return n>=m&&m>=0?1ll*fac[n]*_fac[m]%mod*_fac[n-m]%mod:0;}
inline int Binom(ll n,int m)
{
	if (n<=0||n<=m||m<=0) return 0;
	assert(m<=100000);
	int ans=1;
	rep(i,1,m) ans=1ll*ans*((n-i+1)%mod)%mod;
	return 1ll*ans*_fac[m]%mod; 
} 

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	init(N-10); 
	
	ll n; int m; cin>>n>>m;
	vector<ll> a(m);
	rep(i,0,m-1) cin>>a[i];
	
	int ans=0;
	rep(S,0,(1<<m)-1)
	{
		unsigned long long s=0;
		rep(i,0,m-1) if (S&(1<<i)) s+=a[i]+1;
		if (s>=n) continue;
		inc(ans,1ll*pw[pc[S]]*Binom(n-s+m-1,m-1)%mod);
	}
	
	vector<vector<vector<int> > > dp(63,vector<vector<int> >(1<<m,vector<int>(m)));
	const int V=(1<<m)-1;
	dp[62][V][0]=1;
	
	drep(i,62,1) rep(S,0,(1<<m)-1) rep(j,0,m-1) if (dp[i][S][j])
	{
		for (int s=S;s>=0;s=(!s)?-1:(s-1)&S)
		{
			int T=S,ok=1;
			rep(t,0,m-1) if (S&(1<<t))
			{
				int is=(a[t]>>(i-1))&1;
				if (!is&&((1<<t)&s)) ok=0;
				if (is&&(!((1<<t)&s))) T^=(1<<t); 
			}
			if (!ok) continue;
			rep(k,0,pc[V^S]) 
			{
				int u=k+pc[s],v=2*j+((n>>(i-1))&1);
				if (u%2==1||u>v||v-u>=m) continue;
				inc(dp[i-1][T][v-u],1ll*C(pc[V^S],k)*dp[i][S][j]%mod);
			}
		}
	}
	rep(S,0,V) dec(ans,dp[0][S][0]);
	cout<<ans<<endl;
	
	return 0;
}