/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, n) for(int i = 0; i < n; ++i)
#define RFOR(i, n) for(int i = n-1; i >= 0; --i)
#define output_vec(vec) { FOR(i_, sz(vec)) cout << vec[i_] << ' '; cout << '\n'; }
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<bool> vb;
typedef short si;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

const int INF = 1e9 + 47;

int solve()
{
    int n, m;
    if (!(cin >> n >> m))
        return 1;
        
    vector<set<int>> notes(n);
    FOR (i, n)
    {
        int nn;
        cin >> nn;
        //notes[i].resize(nn);
        FOR (j, nn)
        {
            int el;
            cin >> el;
            notes[i].insert(el);
        }
    }
    
    vector<int> play(m);
    FOR (i, m)
        cin >> play[i];
        
    vector dp(m, vector<int>(n, INF));
    FOR (i, n)
        if (notes[i].count(play[0]))
            dp[0][i] = 0;
    
    int mini = 0;
    FOR (ii, m - 1)
    {
        int i = ii + 1;
        FOR (j, n)
        {
            if (!notes[j].count(play[i]))
            {
                continue;
            }
            if (notes[j].count(play[i]))
                dp[i][j] = min(dp[i][j], dp[i - 1][j]);
            dp[i][j] = min(dp[i][j], dp[i - 1][mini] + 1);
        }
        int curmin = INF, curidx = -1;
        FOR (j, n)
        {
            if (dp[i][j] < curmin)
            {
                curmin = dp[i][j];
                curidx = j;
            }
        }
        mini = curidx;
    }
    
    cout << *min_element(all(dp[m - 1])) << '\n';
    
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}