#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N,M; const ll mo=998244353; const int MAT=8080; bitset<8080> BS[8080]; int V[8080],R[8080]; int Gauss(int R,int C,bitset<8080> BS[MAT],int v[MAT],int r[MAT]) { int i,j,k; int nex=0; FOR(i,R) { while(nex=C) break; swap(BS[i],BS[j]); swap(v[i],v[j]); FOR(j,R) if(i!=j && BS[j][nex]) { v[j]^=v[i]; BS[j]^=BS[i]; } nex++; } FOR(i,C) r[i]=0; int num=0; FOR(i,R) { FOR(j,C) if(BS[i][j]) break; if(j>N>>M; FOR(i,N) BS[0][i]=1; FOR(i,M) { cin>>x; while(x--) { cin>>y; BS[2*i+1][y-1]=1; } FOR(j,N) BS[2*i+2][j]=1^BS[2*i+2][j]; } x=Gauss(2*M+1,N,BS,V,R); ll ret=1; FOR(i,x) ret=ret*2%mo; cout<