#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define K 18
#define N 200000
#define M 262144
#define Z 4
#define g 3
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int n,k,length,F[N+1],G[N+1][2][2],H[N+1][2][2][2][2],dp[N+1],DP[N+1][2],delta[N+1][2][2],A[M+1],B[M+1],C[M+1],D[M+1],fac[N+1],invfac[N+1],inv[N+1],num[M+1],rev[M+1],wn[K+1][M+1],wn2[K+1][M+1],w[1<<Z];
void NTT(int limit,int *s,int type)
{
	int s1,s2;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?limit>>1:0);
	for (int i=0;i<limit;++i)
		if (rev[i]>i)
			swap(s[i],s[rev[i]]);
	if (type==1)
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<(j|(i>>1));++k)
					s1=s[k],s2=1ll*s[k|(i>>1)]*wn[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
	}
	else
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<(j|(i>>1));++k)
					s1=s[k],s2=1ll*s[k|(i>>1)]*wn2[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
		s1=fast_pow(limit,mod-2);
		for (int i=0;i<=limit;++i) s[i]=1ll*s[i]*s1%mod;
	}
	return;
}
vector<int>operator + (vector<int>a,vector<int>b)
{
	if (a.size()<b.size()) swap(a,b);
	for (int i=0;i<b.size();++i) Adder(a[i],b[i]);
	return a;
}
vector<int>operator - (vector<int>a,vector<int>b)
{
	if (a.size()<b.size()) a.resize(b.size());
	for (int i=0;i<b.size();++i) Adder2(a[i],-b[i]);
	return a;
}
vector<int>operator * (vector<int>a,int d)
{
	for (int i=0;i<a.size();++i) a[i]=1ll*a[i]*d%mod;
	return a;
}
vector<int>operator * (vector<int>a,vector<int>b)
{
	if (a.empty()) return a;
	if (b.empty()) return b;
	vector<int>c(a.size()+b.size()-1);
	if (min(a.size(),b.size())<=50)
	{
		for (int i=0;i<a.size();++i)
			for (int j=0;j<b.size();++j)
				Adder(c[i+j],1ll*a[i]*b[j]%mod);
		return c;
	}
	int limit=1;
	while (limit<=a.size()+b.size()) limit<<=1;
	for (int i=0;i<=limit;++i) A[i]=B[i]=0;
	for (int i=0;i<a.size();++i) A[i]=a[i];
	for (int i=0;i<b.size();++i) B[i]=b[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<c.size();++i) c[i]=A[i];
	return c;
}
vector<int>operator ^ (vector<int>a,vector<int>b)
{
	vector<int>c(a.size()-b.size()+1);
	if (min(b.size(),c.size())<=50)
	{
		for (int i=0;i<c.size();++i)
			for (int j=0;j<b.size();++j)
				Adder(c[i],1ll*b[j]*a[i+j]%mod);
		return c;
	}
	int limit=1;
	while (limit<=a.size()) limit<<=1;
	for (int i=0;i<=limit;++i) A[i]=B[i]=0;
	for (int i=0;i<a.size();++i) A[i]=a[i];
	for (int i=0;i<b.size();++i) B[b.size()-i]=b[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<c.size();++i) c[i]=A[b.size()+i];
	return c;
}
vector<int>get_rev(int sz,vector<int>a)
{
	a.resize(sz+1),reverse(a.begin(),a.end());
	return a;
}
void calc_inv(int len,int *s1,int *s2)
{
	if (len==1)
	{
		s2[0]=fast_pow(s1[0],mod-2);
		return;
	}
	int limit=1;
	while (limit<=(len<<1)) limit<<=1;
	calc_inv((len+1)>>1,s1,s2);
	int s3[limit+1];
	for (int i=0;i<=limit;++i) s2[i]=i<((len+1)>>1)?s2[i]:0,s3[i]=i<len?s1[i]:0;
	NTT(limit,s2,1),NTT(limit,s3,1);
	for (int i=0;i<=limit;++i) s2[i]=MD2(2ll*s2[i]%mod-1ll*s2[i]*s2[i]%mod*s3[i]%mod);
	NTT(limit,s2,-1);
	return;
}
vector<int>get_inv(int len,vector<int>p)
{
	vector<int>v(len);
	for (int i=0;i<len;++i) A[i]=i<p.size()?p[i]:0;
	calc_inv(len,A,B);
	for (int i=0;i<len;++i) v[i]=B[i];
	return v;
}
void solve(int l,int r)
{
	if (l==r) return;
	int mid=(l+r)>>1;
	vector<int>p(mid-l+1);
	vector<int>q(r-l+1);
	solve(l,mid);
	for (int i=l;i<=mid;++i) p[i-l]=dp[i];
	for (int i=1;i<=r-l;++i) q[i]=1ll*F[i]*w[0]%mod;
	p=p*q;
	for (int i=mid+1;i<=r;++i) Adder(dp[i],p[i-l]);
	solve(mid+1,r);
	return;
}
void solve2(int l,int r)
{
	if (l==r) return;
	int mid=(l+r)>>1;
	vector<int>p(mid-l+1);
	vector<int>q(r-l+1);
	vector<int>z(r-l+1);
	solve2(l,mid);
	for (int i=l;i<=mid;++i) p[i-l]=MD(1ll*DP[i][0]*w[0]%mod+1ll*DP[i][1]*w[1]%mod);
	for (int i=1;i<=r-l;++i) q[i]=1ll*G[i-1][0][0]*invfac[i]%mod,z[i]=1ll*G[i-1][0][1]*invfac[i]%mod;
	q=p*q,z=p*z;
	for (int i=mid+1;i<=r;++i) Adder(DP[i][0],q[i-l]),Adder(DP[i][1],z[i-l]);
	solve2(mid+1,r);
	return;
}
void solve3(int l,int r)
{
	if (l==r) return;
	int mid=(l+r)>>1;
	vector<int>p[2];
	vector<int>q(r-l+1);
	vector<int>z;
	for (int op=0;op<=1;++op) p[op].resize(mid-l+1);
	solve3(l,mid);
	for (int i=l;i<=mid;++i)
		for (int op=0;op<=1;++op)
			for (int op2=0;op2<=1;++op2)
				Adder(p[op2][i-l],1ll*delta[i][op][op2]*w[op|(op2<<1)]%mod);
	for (int op=0;op<=1;++op)
		for (int op2=0;op2<=1;++op2)
			for (int op3=0;op3<=1;++op3)
			{
				for (int i=1;i<=r-l;++i) q[i]=1ll*H[i-1][op][0][op2][op3]*invfac[i]%mod;
				z=p[op]*q;
				for (int i=mid+1;i<=r;++i) Adder(delta[i][op2][op3],z[i-l]);
			}
	solve3(mid+1,r);
	return;
}
int main()
{
	fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[N]=fast_pow(fac[N],mod-2);
	for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	for (int i=1;i<=N;++i) inv[i]=1ll*fac[i-1]*invfac[i]%mod;
	for (int i=2,w;i<=M;i<<=1)
	{
		num[i]=++length,w=fast_pow(g,(mod-1)/i);
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn[num[i]][j]=res;
		w=fast_pow(g,(mod-1)/i*(i-1));
		for (int j=0,res=1;j<(i>>1);++j,res=1ll*res*w%mod) wn2[num[i]][j]=res;
	}
	n=read(),k=read();
	for (int i=0;i<(1<<(k-1));++i) w[i]=read();
	if (k==2)
	{
		for (int i=1,res=1;i<=n;++i,res=1ll*res*MD2(w[1]-w[0])%mod) F[i]=1ll*res*invfac[i]%mod;
		for (int i=1;i<=n;++i) Adder(dp[i],F[i]);
		solve(1,n),printf("%lld\n",1ll*dp[n]*fac[n]%mod);
	}
	else if (k==3)
	{
		G[0][0][0]=G[0][1][1]=1;
		for (int i=1;i<=n;++i)
			for (int op=0;op<=1;++op)
				for (int op2=0;op2<=1;++op2)
					for (int op3=0;op3<=1;++op3)
					{
						if (!op3) Adder2(G[i][op][op3],-1ll*G[i-1][op][op2]*w[op2|(op3<<1)]%mod);
						else Adder(G[i][op][op3],1ll*G[i-1][op][op2]*w[op2|(op3<<1)]%mod);
					}
		for (int i=2;i<=n;++i)
		{
			Adder(DP[i][0],1ll*G[i-2][1][0]*invfac[i]%mod),Adder(DP[i][1],1ll*G[i-2][1][1]*invfac[i]%mod);
			Adder2(DP[i][0],-1ll*G[i-2][0][0]*invfac[i]%mod),Adder2(DP[i][1],-1ll*G[i-2][0][1]*invfac[i]%mod);
			Adder(DP[i][0],1ll*G[i-2][0][0]*invfac[i-1]%mod),Adder(DP[i][1],1ll*G[i-2][0][1]*invfac[i-1]%mod);
		}
		solve2(1,n),printf("%lld\n",1ll*MD(DP[n][0]+DP[n][1])*fac[n]%mod);
	}
	else
	{
		for (int op=0;op<=1;++op)
			for (int op2=0;op2<=1;++op2)
				H[0][op][op2][op][op2]=1;
		for (int i=1;i<=n;++i)
			for (int op=0;op<=1;++op)
				for (int op2=0;op2<=1;++op2)
					for (int op3=0;op3<=1;++op3)
						for (int op4=0;op4<=1;++op4)
							for (int op5=0;op5<=1;++op5)
							{
								if (!op5) Adder2(H[i][op][op2][op4][op5],-1ll*H[i-1][op][op2][op3][op4]*w[op3|(op4<<1)|(op5<<2)]%mod);
								else Adder(H[i][op][op2][op4][op5],1ll*H[i-1][op][op2][op3][op4]*w[op3|(op4<<1)|(op5<<2)]%mod);
							}
		for (int i=3;i<=n;++i)
			for (int op=0;op<=2;++op)
				for (int op2=0,res;op2<=2;++op2)
				{
					res=1;
					if (op==1) res=MD2(-res);
					if (op2==1) res=MD2(-res);
					if (op==2&&op2==2) res=1ll*res*invfac[i-2]%mod;
					else if (op==2&&op2!=2) res=1ll*res*invfac[i-1]%mod;
					else if (op!=2&&op2==2) res=1ll*res*invfac[i-2]%mod*invfac[2]%mod;
					else res=1ll*res*invfac[i]%mod;
					for (int op3=0;op3<=1;++op3)
						for (int op4=0;op4<=1;++op4)
							Adder(delta[i][op3][op4],1ll*H[i-3][!op][!op2][op3][op4]*res%mod);
				}
		solve3(1,n),printf("%lld\n",1ll*MD(MD(delta[n][0][0]+delta[n][0][1])+MD(delta[n][1][0]+delta[n][1][1]))*fac[n]%mod);
	}
	return 0;
}