#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<vector<int>> a(n);
	rep(i, k) {
		int l, s; cin >> l >> s;
		rep(j, l) {
			int b; cin >> b;
			b--;
			a[b].push_back(s);
		}
	}
	mint ans = 0;
	mint inv2 = mint(2).inv();
	rep(i, n) {
		rep(j, 30) {
			int cnt = 0;
			for (auto e : a[i])if (1 & (e >> j)) cnt++;
			if (cnt == 0)continue;
			ans += mint(1 << j)*inv2;
		}
	}
	cout << ans.val() << endl;
	return 0;
}