#include <bits/stdc++.h> #define maxn 1000005 #define maxm 7005 #define fw(a, b, c) for (int c = a; c <= b; c++) #define bw(a, b, c) for (int c = a; c >= b; c--) #define fileIO(TASK) \ freopen(TASK ".inp", "r", stdin); \ freopen(TASK ".out", "w", stdout); #define effective \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define newbieCoder main() using namespace std; typedef long long ll; const ll mod = 123457; int K, n, S[maxn]; void enter() { cin >> K >> n; memset(S, 0, sizeof S); fw(1, n, i) { int t, c; cin >> t; fw(1, t, j) { cin >> c; S[i] |= (1 << c); } } } inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; } int bitCnt(int x) { int res = 0; fw(0, 9, i) if (x & (1 << i)) res++; return res; } void solve() { int f1[1024], f2[1024]; memset(f2, 0, sizeof f2); f2[0] = 1; bw(n, 1, i) { memcpy(f1, f2, sizeof f2); fw(0, 1023, m) add(f2[S[i] ^ (S[i] & m)], f1[m]); } int res = 0; fw(0, 1023, m) if (__builtin_popcount(m) >= K) add(res, f2[m]); cout << res; } newbieCoder { effective; enter(); solve(); }