/* -*- coding: utf-8 -*-
 *
 * 3528.cc:  No.3528 Happy XOR Candy - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;
const int MOD = 998244353;
const int inv2 = (MOD + 1) / 2;

/* typedef */

using ll = long long;

/* global variables */

int as[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  
  for (int i = 0; i < k; i++) {
    int li, si;
    scanf("%d%d", &li, &si);
    for (int j = 0; j < li; j++) {
      int bj;
      scanf("%d", &bj), bj--;
      as[bj] |= si;
    }
  }

  ll sum = 0;
  for (int i = 0; i < n; i++) sum += as[i];
  int ans = (sum % MOD) * inv2 % MOD;

  printf("%d\n", ans);
  
  return 0;
}