#include #include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define inp(x) for(auto &i:x)cin>>i #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using boost::multiprecision::cpp_int; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // 1010 1010 1010 // 0 110 0 ll n,k;cin>>n>>k; vvl A(n,vl(30,0)); rep(i,0,k){ ll l,s;cin>>l>>s; bitset<30> bs(s); rep(j,0,l){ ll b;cin>>b; b--; rep(t,0,30){ A[b][t] += bs[t]; } } } // 1ビットにつき、1がx個、0がk-x個あるとき、xorが1となるのは1を奇数個選んだ時。 // xC1*2^(k-x)+xC3*2^(k-x)+...+xC(2i+1)*2^(k-x) // Sum[comb(x,2i+1)*2^(k-x),{i,0,Floor[x/2]}] // 2^(k-1)か mint ans=0; rep(i,0,n){ rep(j,0,30){ ll x=A[i][j]; if(x==0)continue; ans += mint(2).pow(k-1+j); } } ans*=mint(2).pow(k).inv(); cout<