#include<bits/stdc++.h>
#define IL inline
#define reg register
#define mod 998244353
#define N 300300
IL int read()
{
    reg int x=0,f=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}

template<class T>IL T power(reg T x,reg int p){reg T r=1;for(;p;p>>=1,x*=x)if(p&1)r*=x;return r;}

namespace montgo
{
	using u64=unsigned long long; 
	const unsigned pp()
	{
		reg unsigned pn=mod; 
		pn*=2-mod*pn,pn*=2-mod*pn,pn*=2-mod*pn,pn*=2-mod*pn; 
		return pn; 
	}
	const unsigned P=mod,P2=P<<1,r=-pp(),r2=-u64(P)%P; 
    IL unsigned reduce(reg u64 x){return(x+u64((unsigned)x*r)*P)>>32;}
    struct mont
    {
        unsigned v; 
        mont()=default; 
        ~mont()=default; 
        IL mont(unsigned v):v(reduce(u64(v)*r2)){}
        IL mont(const mont &rhs):v(rhs.v){}
        IL unsigned get(){reg unsigned ret=reduce(v);return ret-(P&-(ret>=P));}
        IL mont &operator =(const mont &rhs){return v=rhs.v,*this;}
        IL mont operator -(){reg mont ret;return ret.v=(v?P2-v:0),ret;}
        IL mont &operator +=(const mont &rhs){return v+=rhs.v-P2,v+=(signed(v)<0?P2:0),*this;}
        IL mont &operator -=(const mont &rhs){return v-=rhs.v,v+=(signed(v)<0?P2:0),*this;}
        IL mont &operator *=(const mont &rhs){return v=reduce(u64(v)*rhs.v),*this;} 
        IL mont &operator /=(const mont &rhs){return this->operator*=(power(rhs,P-2));}
        IL friend mont operator +(const mont lhs,const mont rhs){return mont(lhs)+=rhs;}
        IL friend mont operator -(const mont lhs,const mont rhs){return mont(lhs)-=rhs;}
        IL friend mont operator *(const mont lhs,const mont rhs){return mont(lhs)*=rhs;}
    };
}

using montgo::mont;

mont fac[N],ifac[N],inv[N];

IL void init(reg int n)
{
    fac[0]=ifac[0]=inv[1]=1;
    for(reg int i=2;i<=n;++i)inv[i]=inv[mod%i]*mont(mod-mod/i);
    for(reg int i=1;i<=n;++i)fac[i]=fac[i-1]*mont(i),ifac[i]=ifac[i-1]*inv[i];
}

namespace NTT
{

mont a[N],G[N+N];
int len,r[N];

IL void prework(reg int n)
{
    for(len=1;len<=n;len<<=1);
    for(reg int i=0;i<len;++i)a[i]=0,r[i]=r[i>>1]+(i&1)*len>>1;
}

IL void dft(reg mont *f)
{
    for(reg int i=0;i<len;++i)if(r[i]>i)std::swap(f[i],f[r[i]]);
    mont x,y;
    for(reg int k=2,i,j;k<=len;k<<=1)for(i=0;i<len;i+=k)for(j=i;j<i+k/2;++j)
        x=f[j],y=f[j+k/2]*G[k+j-i],f[j]=x+y,f[j+k/2]=x-y;
}

IL void idft(reg mont *f)
{
    dft(f),std::reverse(f+1,f+len);
    reg int inv=mod-(mod-1)/len;
    for(reg int i=0;i<len;++i)f[i]*=inv;
}

}

using namespace NTT;

int n,k,full;
mont con[8],f[N][4];

IL int tr(reg int s,reg int x){return s|(x<<k-2);}

mont dp[4][N][4],tmp[4][4][N+N];

void dc(reg int l,reg int r)
{
    if(l==r)return;
    reg int mid=l+r>>1;
    dc(l,mid);
    for(reg int s=full,t,i;s--;)for(t=full;t--;)
    {
        prework(r-l<<1);
        for(i=l;i<=mid;++i)a[i-l]=f[i][s];
        dft(a);
        for(i=0;i<len;++i)a[i]*=tmp[s][t][len+i];
        idft(a);
        for(i=mid+1;i<=r;++i)f[i][t]+=a[i-l];
    }
    dc(mid+1,r);
}

main()
{
    for(reg int k=2,i;k<N;k<<=1)
    {
        mont w=power((mont)3,(mod-1)/k);
        G[k]=1;
        for(i=1;i<k/2;++i)G[k+i]=G[k+i-1]*w;
    }
    n=read(),k=read(),full=1<<k-2,init(n);
    for(reg int i=0;i<full*2;++i)con[i]=read();
    f[0][0]=1;

    for(reg int i=1,j,s,t;i<=k;++i)for(s=full;s--;)
    {
        mont w=f[i-1][s];
        static mont g[4],ng[4];
        for(t=full;t--;)g[t]=0;
        reg int nxt=tr(s,0);
        g[nxt>>1]=w*(i>=k?con[nxt]:1);
        for(j=i;j<=n;++j)
        {
            for(t=full;t--;)
            {
                w=g[t];
                f[j][t]+=w*ifac[j-i+1];
                nxt=tr(t,1);
                ng[nxt>>1]+=w*(j>=k-1?con[nxt]:1);
                nxt=tr(t,0);
                ng[nxt>>1]-=w*(j>=k-1?con[nxt]:1);
            }
            for(t=full;t--;)g[t]=ng[t],ng[t]=0;
        }
    }
    for(reg int s=full,i,t;s--;)
    {
        mont w;
        static mont g[4],ng[4];
        for(t=full;t--;)g[t]=0;
        reg int nxt=tr(s,0);
        g[nxt>>1]=con[nxt];
        for(i=1;i<=n;++i)
        {
            for(t=full;t--;)
            {
                w=g[t];
                dp[s][i][t]+=w*ifac[i];
                nxt=tr(t,1);
                ng[nxt>>1]+=w*con[nxt];
                nxt=tr(t,0);
                ng[nxt>>1]-=w*con[nxt];
            }
            for(t=full;t--;)g[t]=ng[t],ng[t]=0;
        }
    }
    for(reg int k=2,s,t,i;k<N/2;k<<=1)for(s=full;s--;)for(t=full;t--;)
    {
        prework(k);
        for(i=1;i<=k;++i)a[i]=dp[s][i][t];
        dft(a);
        for(i=0;i<len;++i)tmp[s][t][len+i]=a[i];
    }
    dc(k,n);
    reg mont ans=0;
    for(reg int i=full;i--;)ans+=f[n][i];
    printf("%d\n",(ans*fac[n]).get());
}