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

int main(){
  using mint=atcoder::modint998244353;
  int log=30;
  int n,k;
  cin>>n>>k;
  vector<int> l(k),s(k);
  vector<vector<int>> cnt(n,vector<int>(log));
  for (int i=0;i<k;i++){
    cin>>l[i]>>s[i];
    for (int t=0;t<l[i];t++){
      int b;
      cin>>b;
      b--;
      for (int j=0;j<log;j++){
        if (s[i]>>j&1) cnt[b][j]++;
      }
    }
  }
  mint ans=0;
  vector<mint> pw(log);
  pw[0]=1;
  for (int i=1;i<log;i++) pw[i]=pw[i-1]*2;
  for (int i=0;i<n;i++){
    for (int j=0;j<log;j++){
      int c1=cnt[i][j];
      if (c1==0) continue;
      ans+=pw[k-1]*pw[j];
    }
  }
  ans/=pw[k];
  cout<<ans.val()<<endl;
}