//qoj1427
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll P = 998244353;
const int N = 2e5 + 10;
int n, m, c, a[N];
ll fac[N], inv[N], pw[N], ivy, ans[N];
vector<pair<int, int> > g[N], h[N];

ll qp(ll x, ll y){
    ll ans = 1;
    while(y){
        if(y & 1){
            ans = ans * x % P;
        }
        x = x * x % P;
        y >>= 1;
    }
    return ans;
}
ll C(int x, int y){
    if(x < y) return 0;
    return fac[x] * inv[y] % P * inv[x-y] % P;
}

int main(){
    fac[0] = pw[0] = 1;
    for(int i = 1; i < N; ++ i){
        fac[i] = fac[i-1] * i % P;
        pw[i] = pw[i-1] * 2 % P;
    }
    inv[N-1] = qp(fac[N-1], P-2);
    for(int i = N - 2; i >= 0; -- i){
        inv[i] = inv[i+1] * (i+1) % P;
    }
    scanf("%d%d", &n, &m);
    ivy = qp(pw[n+n], P-2);
    for(int cs = 1; cs <= m; ++ cs){
        scanf("%d", &c);
        for(int i = 1; i <= c; ++ i){
            scanf("%d", &a[i]);
        }
        if(a[c] < n + n){
            ans[cs] = (ans[cs] + C(a[c]-c, n-c) * pw[n+n-a[c]]) % P;
        }
        g[c].push_back(make_pair(max(n, a[c]+1), cs));
        int ls = n - 1;
        if(c > 450){
            for(int i = 1; i <= c; ++ i){
                if(a[i] > ls){
                    for(int k = ls+1; k < a[i]; ++ k){
                        ans[cs] = (ans[cs] + C(k-i, n-1) * pw[n+n-k]) % P;
                    }
                    ls = a[i];
                }
            }
            h[c+1].push_back(make_pair(ls+1, cs));
            h[c+1].push_back(make_pair(n+n, -cs));
        } else {
            for(int i = 1; i <= c; ++ i){
                if(a[i] > ls){
                    h[i].push_back(make_pair(ls+1, cs));
                    h[i].push_back(make_pair(a[i], -cs));
                    ls = a[i];
                }
            }
            h[c+1].push_back(make_pair(ls+1, cs));
            h[c+1].push_back(make_pair(n+n, -cs));
        }
    }
    for(int i = 1; i <= n; ++ i){
        if(g[i].size()){
            sort(g[i].begin(), g[i].end());
            reverse(g[i].begin(), g[i].end());
            int nw = n + n;
            ll rs = 0;
            for(auto j : g[i]){
                while(nw > j.first){
                    -- nw;
                    rs = (rs + C(nw-1-i, n-1-i) * pw[n+n-nw]) % P;
                }
                ans[j.second] = (ans[j.second] + rs) % P;
            }
        }
    }
    for(int i = 1; i <= n + 1; ++ i){
        if(h[i].size()){
            sort(h[i].begin(), h[i].end());
            reverse(h[i].begin(), h[i].end());
            int nw = n + n;
            ll rs = 0;
            for(auto j : h[i]){
                while(nw > j.first){
                    -- nw;
                    rs = (rs + C(nw-i, n-1) * pw[n+n-nw]) % P;
                }
                if(j.second > 0){
                    ans[j.second] = (ans[j.second] + rs) % P;
                } else {
                    ans[-j.second] = (ans[-j.second] - rs + P) % P;
                }
            }
        }
    }
    for(int i = 1; i <= m; ++ i){
        printf("%lld\n", 2 * ans[i] * ivy % P);
    }
    return 0;
}