#include<iostream>
#include<cstdio>
#define N 200002
#define Base 300
#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;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    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,q,k,inv2,fac[N+1],invfac[N+1],b[N+1],f[N+1],s[N+1],sr[Base+1][N+1],ans;
int C(int x,int y)
{
    if (x<y) return 0;
    return 1ll*fac[x]*invfac[y]%mod*invfac[x-y]%mod;
}
int MD(int x)
{
    return (x>=mod)?x-mod:x;
}
int MD2(int x)
{
    return (x<0)?x+mod:x;
}
int F(int x,int y)
{
    if (x>n||y>n||x<0||y<0) return 0;
    return C((n<<1)-x-y,n-x);
}
int G(int l,int r)
{
    return (!l)?s[r]:MD2(s[r]-s[l-1]);
}
int main()
{
    fac[0]=f[0]=1,inv2=(mod+1)>>1;
    for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod,f[i]=1ll*f[i-1]*inv2%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;
    n=read(),q=read();
    for (int i=1;i<=N;++i) s[i]=MD(s[i-1]+1ll*C(i,n-1)*f[i]%mod);
    for (int i=2;i<=Base;++i)
    {
	sr[i][n<<1]=0;
	for (int j=(n<<1)-1;j>=1;--j) sr[i][j]=MD(sr[i][j+1]+1ll*F((n<<1)-j,i+1)*f[j]%mod);
    }
    while (q--)
    {
	k=read(),ans=0;
	for (int i=1;i<=k;++i) b[i]=read();
	//[b[k]+1,n]
	if (k<=Base) Adder(ans,sr[k][b[k]+1]);
	else
	{
	    for (int i=b[k]+1;i<(n<<1);++i) Adder(ans,1ll*F((n<<1)-i,k+1)*f[i]%mod);
	}
	//b[k]
	if (b[k]!=(n<<1)) Adder(ans,1ll*F((n<<1)-b[k],k)*f[b[k]]%mod);
	//[1,b[1]-1]
        if (1<=b[1]-1) Adder(ans,1ll*s[b[1]-2]*f[1]%mod);
	//[b[i]+1,b[i+1]-1]
	for (int i=1;i<=k-1;++i)
	    if (b[i]+1<=b[i+1]-1)
	        Adder(ans,1ll*G(b[i]-i,b[i+1]-i-2)*f[i+1]%mod);
	//[b[k]+1,(n<<1)-1]
	if (b[k]+1<=(n<<1)-1) Adder(ans,1ll*G(b[k]-k,(n<<1)-k-2)*f[k+1]%mod);
	printf("%lld\n",2ll*ans%mod);
    }
    return 0;
}