#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct unionfind{
    int n;
    vector<int> parent;
    vector<int> num;

    unionfind(int n):n(n),parent(vector<int>(n)),num(vector<int>(n,1)){
        for(int i = 0; i < n; i++) parent[i] = i;
    }

    int find(int n){
        if (parent[n] == n) return n;
        parent[n] = find(parent[n]);
        return parent[n];
    }

    int merge(int n,int m){
        n = find(n);
        m = find(m);
        if (n==m) return n;
        if (num[n]>num[m]) return merge(m,n);
        parent[m] = n;
        num[n] += num[m];
        return n;
    }

    int getnum(int n){
        return num[find(n)];
    }
};

const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

int main(){
    int n,m;
    cin>>n>>m;
    vector<int> c1(n,0),c2(n,0);
    for(int i = 0;i<m;i++){
        int l;
        cin>>l;
        vector<int> cc(n,0);
        for(int j = 0;j<l;j++){
            int a;
            cin>>a;
            a--;
            c1[a]++;
            cc[a]++;
        }
        for(int j = 0;j<n;j++) if(cc[j]==0) c2[j]++;
    }
    int a = 0,b = 0;
    for(int i = 0;i<n;i++) if(c1[i]==m) a++;
    for(int i = 0;i<n;i++) if(c2[i]==m) b++;
    int need = n - max(0,a-1) - max(0,b-1);
    cout<<mint(2).pow(need)<<endl;
}