#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

using lld = int64_t;
const int mod = 1'000'000'007;
int add(int a, int b) {
  assert(0 <= a and a < mod);
  assert(0 <= b and b < mod);
  return a + b >= mod ? a + b - mod : a + b;
}
int mul(lld a, lld b) {
  assert(0 <= a and a < mod);
  assert(0 <= b and b < mod);
  return static_cast<int>(a * b % mod);
}

struct Segtree {
  int n;
  vector<int> st;
  Segtree(int _n) : n(_n), st(n * 2) {}
  void set(int p, int v) {
    for (st[p += n] = v; p >>= 1; )
      st[p] = add(st[p << 1], st[p << 1 | 1]);
  }
  int query(int l, int r) {
    int res = 0;
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) res = add(res, st[l++]);
      if (r & 1) res = add(res, st[--r]);
    }
    return res;
  }
};

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int n, m;
  while (cin >> n >> m) {

    vector<int> best(m, m);
    for (int i = 0; i < n; i++) {
      int k;
      cin >> k;
      for (int j = 0; j < k; j++) {
        int x;
        cin >> x;
        --x;
        best[x] = min(best[x], j);
      }
    }

    vector<int> r(m);
    for (int i = 0; i < m; i++)
      cin >> r[i], --r[i];


    int ans = 1;
    vector<int> cnt(m), way(m + 1);
    way[0] = 0;
    for (int i = 1; i <= m; i++)
      way[i] = add(add(way[i - 1], way[i - 1]), 1);
    orange(all(way));

    for (int i = 0; i < m; i++)
      if (best[i] < m)
        ++cnt[best[i]];

    Segtree sgt(m);

    for (int i = 0; i < m; i++)
      sgt.set(i, way[cnt[i]]);

    for (int i = 0; i < m; i++) {
      // r[i] is not in the set
      // r[0..i-1] is in the set

      int b = best[r[i]];
      if (b < m) {
        --cnt[b];
        sgt.set(b, way[cnt[b]]);

        int q = sgt.query(0, b + 1);
        debug(q, "case 1");
        ans = add(ans, q);
      } else {
        int q = sgt.query(0, m);
        debug(q, "case 2");
        ans = add(ans, q);
      }
      ans = add(ans, 1);
    }
    cout << ans << '\n';
  }

  return 0;
}