#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 endl "\n"
#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; }
mint count_spanning_tree(vector<vector<mint>> mat) {
	//行列木定理
	mint ans = 1;
	rep(i, mat.size()) {
		if (0 == i)continue;
		ans *= mat[i][i];
		if (0 == mat[i][i]) continue;
		mint inv = inv_mod(mat[i][i].val(), mod);
		rep(j, mat.size()) {
			if (i == j) continue;
			mint num = mat[j][i] * inv;
			rep(k, mat.size()) mat[j][k] -= num * mat[i][k];
		}
	}
	return ans;
}
int popcount(long long n) {
	n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
	n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
	n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
	n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
	n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
	n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
	return n;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector e(k, vector<P>());
	rep(i, k) {
		int t; cin >> t;
		rep(j, t) {
			int a, b; cin >> a >> b;
			a--, b--;
			e[i].push_back({ a,b });
		}
	}
	mint ans = 0;
	rep(i, 1 << k) {
		vector<vector<mint>> mat(n, vector<mint>(n));
		rep(j, k) {
			if (1 & (i >> j)) {
				for (auto vp : e[j]) {
					auto[x, y] = vp;
					mat[x][x]++;
					mat[y][y]++;
					mat[x][y]--;
					mat[y][x]--;
				}
			}
		}
		auto get = count_spanning_tree(mat);
		if (k % 2 == popcount(i) % 2)ans += get;
		else ans -= get;
	}
	cout << ans.val() << endl;
	return 0;
}