2
1 31
 2
1 0
 10
450661 128600 993228 725823 293549 33490 843121 903634 556169 448234
 1
1
 5
1 3 5 7 9
 6
524 529 5249 524 529 529
 3
1 2 3
 2
0 1
 55
0 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 3 4 5 6 7 8 9 4 5 6 7 8 9 5 6 7 8 9 6 7 8 9 7 8 9 8 9 9
 16
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
 3
128 1024 2048
 10
3 3 3 5 5 3 3 3 3 5
 1
0
 2
1 2
 2
0 0
 2
1 1

0
 2
 632
 0
 0
 24
 2
 2
 621247139
 64594
 4
 0
 1
 1
 3
 0

#include <bits/stdc++.h>
using namespace std;
const int prime = 999983;
const int INF = 0x7FFFFFFF;
const long long INFF = 0x7FFFFFFFFFFFFFFF;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const long long mod = 1e9 + 7;
long long qpow(long long a, long long b) {
  long long s = 1;
  while (b > 0) {
    if (b & 1) s = s * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1};
const int N = 20;
int A[(1 << N) + 100];
int F[(1 << N) + 100];
int pow2[(1 << N) + 100];
int main(void) {
  int m;
  pow2[0] = 1;
  for (int i = 1; i < (1 << N); ++i) pow2[i] = pow2[i - 1] * 2 % mod;
  int n;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    int k;
    scanf("%d", &k);
    int t = 0;
    for (int i = 0; i < k; i++) {
      int a;
      scanf("%d", &a);
      t |= 1 << (a - 1);
    }
    F[t]++;
  }
  for (int i = 0; i < m; ++i) {
    for (int mask = 0; mask < (1 << m); ++mask)
      if (mask & (1 << i)) F[mask] += F[mask ^ (1 << i)];
  }
  int ans = 0;
  for (int mask = 0; mask < (1 << m); ++mask) {
    int t = 1;
    if ((m - __builtin_popcount(mask)) & 1) t = -1;
    ans = (ans + 1ll * t * pow2[F[mask]] % mod + mod) % mod;
  }
  cout << ans << endl;
  return 0;
}
