#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;

template <typename T> T rd_integer() {
    T ret = 0;
    bool minus = false;

    char c = getchar_unlocked();
    while (!isdigit(c)) minus |= (c == '-'), c = getchar_unlocked();
    while (isdigit(c)) ret = (ret << 1) + (ret << 3) + (c ^ 48), c = getchar_unlocked();

    return minus ? -ret : ret;
}
int rdi() { return rd_integer<int>(); }
long long rdll() { return rd_integer<long long>(); }
std::string rdstr() {
    std::string ret;
    char c = getchar_unlocked();
    while (!isgraph(c)) c = getchar_unlocked();
    while (isgraph(c)) ret += c, c = getchar_unlocked();
    return ret;
}


int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false);
    int N = rdi(), M = rdi();
    vector<int> hashs(N);
    while (M--) {
        int l = rdi();
        while (l--) hashs.at(rdi() - 1) += (M + 1) * (M + 1) * (M + 1);
    }
    std::sort(hashs.begin(), hashs.end());
    int cnt = 1;
    for (int i = 1; i < N; ++i) cnt += (hashs[i] != hashs[i - 1]);

    cout << atcoder::modint998244353(2).pow(cnt).val() << endl;
}