1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
// O( sum_l * m log m + n * m + n^2m/64 + sum_l * n )
// dziala na przykladowym to wysylam :D
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PI;
typedef long long LL;
typedef double D;
#define FI first
#define SE second
#define MP make_pair
#define PB push_back
#define R(I,N) for(int I=0;I<N;I++)
#define F(I,A,B) for(int I=A;I<B;I++)
#define FD(I,N) for(int I=N-1;I>=0;I--)
#define make(A) scanf("%d",&A)
#define make2(A,B) scanf("%d%d",&A,&B)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define db if(1)printf
template<typename C> void MA(C& a,C b){if(a<b)a=b;}
template<typename C> void MI(C& a,C b){if(a>b)a=b;}
#define MAX 1001
int inf = 1e9;
int n,m;
vector<int> d[MAX];
int z[MAX];
vector<int> t[2][MAX];
bool mam[2][MAX];
void kompresuj(vector<int>& a){
  if(a.size() >= 2*m){
    vector<int> komp;
    R(i,m-1)komp.PB(a[i]);
    komp.PB(n);
    R(i,m-1)komp.PB(a[SZ(a)-m+i+1]);
    swap(komp,a);
  }
}
int kmp[MAX];
void licz_kmp(){
  int t = 0;
  F(i,1,m){
    while(t != 0 && z[i] != z[t]) t = kmp[t-1];
    if(z[i] == z[t])t++;
    kmp[i] = t;
  }
}
bool szukaj(vector<int> &a){
  int t = 0;
  for(int ak:a){
    while(t != 0 && ak != z[t]) t = kmp[t-1];
    if(ak == z[t])t++;
    if(t == m)return 1;
  }
  return 0;
}
bitset<1001> pref[MAX],suf[MAX];
void licz_suf(int i, vector<int>& a){
  int t = 0;
  for(int ak:a){
    while(t != 0 && ak != z[t]) t = kmp[t-1];
    if(ak == z[t])t++;
  }
  while(t){
    suf[i][t] = 1;
    t = kmp[t-1];
  }
}
void licz_pref(int i, vector<int>& a){
  int t = 0;
  FD(i,SZ(a)){
    int ak = a[i];
    while(t != 0 && ak != z[t]) t = kmp[t-1];
    if(ak == z[t])t++;
  }
  while(t){
    pref[i][m-t] = 1;
    t = kmp[t-1];
  }
}
bool cz[MAX][MAX];
int wyn[MAX][MAX];
inline bool spr(int x,int y){
  return (suf[x]&pref[y]).any();
}
int dfs(int x,int y){
  if(cz[x][y])return wyn[x][y];
  cz[x][y] = 1;
  if(spr(x,y))
    return wyn[x][y] = 1;
  else
    wyn[x][y] = inf;
  return wyn[x][y] = dfs(d[x].back(),d[y][0]) + 1;
}
int odp[MAX];
bool odw[MAX];
int bfs(){
  int res = inf;
  vector<int> s,s2;
  s.PB(0);
  int dod = 0;
  while(!s.empty()){
    for(int x:s){
      MI(res,dod + odp[x]);
      for(int ak:d[x]){
        if(!odw[ak]){
          odw[ak] = 1;
          s2.PB(ak);
        }
      }
    }
    s.clear();
    swap(s,s2);
    dod++;
  }
  return res;
}
main(){
  make2(n,m);
  R(i,n){
    int pom;make(pom);while(pom--){
      int pom2;make(pom2);pom2--;
      d[i].PB(pom2);
    }
    t[0][i].PB(i);
  }
  d[n].PB(n);
  R(i,m){
    make(z[i]);
    z[i]--;
  }
  licz_kmp();
  if(m == 1) mam[0][z[0]] = 1;
  R(wyn,11){ // log m
    int _ = wyn%2;
    if(mam[_][0] == 1){
      printf("%d\n",wyn+1);
      return 0;
    }
    R(i,n){
      t[!_][i].clear();
      mam[!_][i] = 0;
      for(int ak :d[i]){ // sum_l
        mam[!_][i] |= mam[_][ak];
        for(int x : t[_][ak]) // m
          t[!_][i].PB(x);
      }
      if(mam[!_][i] == 0)
        mam[!_][i] |= szukaj(t[!_][i]);
      kompresuj(t[!_][i]);
    }
  }
    
  R(i,n)licz_suf(i,t[1][i]); // n * m
  R(i,m/2)swap(z[i],z[m-i-1]);
  licz_kmp();
  R(i,n)licz_pref(i,t[1][i]);
  
  R(i,n){ // n * n * m / 64 
    odp[i] = mam[1][i]?0:inf;
    F(j,1,SZ(d[i]))
      MI(odp[i],dfs(d[i][j-1],d[i][j]));
  }
  int res = bfs(); //sum_l * n
  if(res > inf/2)
    puts("NIE");
  else
    printf("%d\n",res+12);
}