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
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PI;
typedef unsigned 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 65
LL ak,zle,t[MAX];
int n,m,k;
void brut2(){
  bitset<201> ak,zle,t[201],t2[201][201];
  R(i,n){
    scanf(" ");
    R(j,n)t[i][j] = getchar() == '1';
  }
  F(i,m,n){
    zle[i] = 1;
  }
  R(i,k){
    int pom;
    make(pom);
    ak[pom-1] = 1;
  }
  R(i,678901){
    if((ak & zle).none()){
      printf("%d\n",i);
      return;
    }
    bitset<201> pom;
    R(i,n)if(ak[i]) pom |= t[i];
    swap(ak,pom);
  }
  puts("-1");
}
main(){
  make2(n,m);make(k);
  if(n > 64){
    brut2();
    return 0;
  }
  R(i,n){
    scanf(" ");
    R(j,n)if(getchar() == '1')t[i] |= (1ll<<j);
  }
  F(i,m,n){
    zle |= 1ll<<i;
  }
  R(i,k){
    int pom;
    make(pom);
    ak |= 1ll<<(pom-1);
  }
  int kon = 2e8 / n;
  R(i,kon){
    if((ak & zle) == 0){
      printf("%d\n",i);
      return 0;
    }
    LL pom = 0;
    R(i,n)if((ak>>i)&1) pom |= t[i];
    ak = pom;
  }
  puts("-1");
}