#ifdef LOCAL #define _GLIBCXX_DEBUG #else #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl") #endif #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair P; typedef pair Pi; typedef vector Vec; typedef vector Vi; typedef vector Vs; typedef vector Vc; typedef vector

VP; typedef vector VVP; typedef vector VV; typedef vector VVi; typedef vector VVc; typedef vector VVV; typedef vector VVVV; #define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__)) #define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__)) #define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__))) #define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__))))) #define endl '\n' #define REP(i, a, b) for(ll i=(a); i<(b); i++) #define PER(i, a, b) for(ll i=(a); i>=(b); i--) #define rep(i, n) REP(i, 0, n) #define per(i, n) PER(i, n, 0) const ll INF = 4'000'000'000'000'000'010LL; const ll MOD=998244353; #define Yes(n) cout << ((n) ? "Yes" : "No") << endl; #define YES(n) cout << ((n) ? "YES" : "NO") << endl; #define ALL(v) v.begin(), v.end() #define rALL(v) v.rbegin(), v.rend() #define pb(x) push_back(x) #define mp(a, b) make_pair(a,b) #define Each(a,b) for(auto &a :b) #define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i) #define SUM(a) accumulate(ALL(a),0LL) #ifdef LOCAL #define dbg(x_) cerr << #x_ << ":" << x_ << endl; #define dbgmap(mp) cerr << #mp << ":"<first <<":"<second << endl;} #define dbgset(st) cerr << #st << ":"<bool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (bauto lb(T &X, ll x){return lower_bound(ALL(X),x) - X.begin();} templateauto ub(T &X, ll x){return upper_bound(ALL(X),x) - X.begin();} ll popcnt(ll x){return __builtin_popcount(x);} ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);} ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;}; ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;}; template ostream &operator<<(ostream &s, const pair &p) { return s<<"("< istream &operator>>(istream &i, pair &p) { return i>>p.first>>p.second; } templateistream& operator>>(istream&i,vector&v) {rep(j,v.size())i>>v[j];return i;} // vector template ostream &operator<<(ostream &s, const vector &v) { int len=v.size(); for(int i=0; i ostream &operator<<(ostream &s, const vector > &vv) { s<= 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;} bool operator==(const mint a) const { return x == a.x;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll n) const { mint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } // for prime MOD mint inv() const { return pow(MOD-2);} mint& operator/=(const mint& a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} typedef vector Vmint; typedef vector VVmint; typedef vector VVVmint; typedef vector VVVVmint; #define MAKEVVmint(variable, a, ...) VVmint variable(a,Vmint(__VA_ARGS__)) #define MAKEVVVmint(variable, a, b, ...) VVVmint variable(a, VVmint(b, Vmint(__VA_ARGS__))) #define MAKEVVVVmint(variable, a, b, c, ...) VVVVmint variable(a, VVVmint(b, (VVmint(c, Vmint(__VA_ARGS__))))) struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < MOD); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } }; struct CompareBitset{ Vec v; ll size; using C = CompareBitset; CompareBitset(ll n):size((n+63)/64){ v.resize(size); } void orbit(ll x){ v[x/64] |= (1<<(x%64)); } void xorbit(ll x){ v[x/64] ^= (1<<(x%64)); } void andbit(ll x){ v[x/64] &= (1<<(x%64)); } C operator ^(const C& d) const{ C res = C(0); res.v.resize(size); rep(i,size){ ll x = v[i] ^ d.v[i]; res.v[i] = v[i] ^ d.v[i]; } return res; } C operator |(const C& d) const{ C res = C(size); rep(i,size){ res.v[i] = v[i] | d.v[i]; } return res; } C operator &(const C& d) const{ C res = C(size); rep(i,size){ res.v[i] = v[i] & d.v[i]; } return res; } bool operator<(const C& d) const { per(i,size-1){ if(v[i] < d.v[i]){ return true; } } return false; }; bool operator == (const C& d) const { per(i,size-1){ if(v[i] != d.v[i]){ return false; } } return true; }; }; ostream& operator<<(ostream& os, const CompareBitset& a) { return os << a.v;} int solve(){ ll n; cin>>n; ll m; cin>>m; /* * よい集合とは? * P(X) を X の部分集合全体として * Pの部分集合である。 * * A ∈ Sなら A^c ∈ S つまり、補集合も集合に含まれている。 * A,B ∈ Sなら、 A U B ∈ S * A_1,A_2,........A_m ∈ S * 空集合 ∈ S */ vector g(m+1, CompareBitset(1000)); rep(i,m){ ll l;cin>>l; rep(j,l){ ll x; cin>>x; x--; //g[i][x] = 1; g[i].orbit(x); } } rep(i,n){ g[m].orbit(i); } rep(i,n){ dbg(g[i]); } vector base; CompareBitset I(1000); Each(v, g) { Each(e, base) { //vをmin(v, v^e)に更新する v = min(v, v ^ e); } if(v == I)continue; base.pb(v); } dbg(base); mint ans = mint(2).pow(base.size()); out(ans); return 0; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout<>T; // while(T--) solve(); }