#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
const ll MOD = 998244353;
struct UnionFind{
    vector<ll> par, siz;
    UnionFind(int N) : par(N), siz(N,1){
        rep(i,N) par[i] = i;
    }
    int root(int x){
        if(par[x]==x) return x;
        return par[x] = root(par[x]);
    }
    bool unite(int x,int y){
        x = root(x); y = root(y);
        if(x==y) return false;
        if(siz[x]<siz[y]) swap(x,y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    ll size(int x){
        return siz[root(x)];
    }
    bool same(int x,int y){
        return root(x) == root(y);
    }
};
ll mpow(ll x, ll y){
    ll res = 1; x %= MOD;
    while(y){
        if(y%2) res = res * x % MOD;
        x = x * x % MOD;
        y /= 2;
    }
    return res;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<bitset<1000>> bit(1000);
    rep(i,n) bit[i].flip();
    rep(i,m){
        int l;
        cin >> l;
        vector<vector<int>> a(2);
        vector<bool> ok(n, false);
        rep(j,l){
            int k;
            cin >> k;
            ok[k-1] = true;
        }
        rep(j,n) a[ok[j]].push_back(j);
        for(int x:a[0]){
            for(int y:a[1]){
                bit[x][y] = bit[y][x] = 0;
            }
        }
    }
    UnionFind uf(n);
    int s = n;
    rep(i,n) rep(j,n) if(bit[i][j]) s -= uf.unite(i,j);
    cout << mpow(2, s) << '\n';
    return 0;
}