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
#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()

#define VI vector<int>
#define PII pair<int,int>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define lint long long int

#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; } 
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; } 
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}

#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue

#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}

using namespace std;

int n,b,r;

int dl;
char s[205];

vector<vector<lint> > macierz;

vector<lint> F(vector<lint> v) {
  vector<lint> res;
  FOR(i,0,dl) res.pb(0LL);
  FOR(j,0,dl) {
    FOR(k,j*62, min((j+1)*62,n)) {
      if(v[j] & (1LL<<(k-j*62))) {
        FOR(u,0,dl) {
          res[u] |= macierz[k][u];
        }
      }
    }
  }
  return res;
}

vector<lint> wykrywacz;

bool dobry(vector<lint> v) {
  FOR(j,0,dl) 
    if( v[j] & wykrywacz[j] ) return false;
  return true;
}

set<vector<lint> > bylo;

int main() {
  read3(n,b,r);
  dl = (n+61)/62;

  FOR(j,0,dl) {
    lint x = 0LL;
    FOR(k,j*62,min((j+1)*62,n)) {
      if(k>=b) x |= (1LL << (k-j*62));
    }
    wykrywacz.pb(x);
  }

  FOR(i,0,n) {
    scanf("%s", s);
    vector<lint> u;
    FOR(j,0,dl) {
      lint x = 0;
      FOR(k,j*62,min((j+1)*62,n)) {
        if(s[k]=='1') x |= (1LL<<(k-j*62));
      }
      u.pb(x);
    }
    macierz.pb(u);
  }
  vector<lint> gornicy;
  FOR(j,0,dl) gornicy.pb(0LL);
  FOR(i,0,r) {
    make(g); g--;
    gornicy[g/62] |= (1LL << (g%62));
  }
  int ans = 0;
  while (bylo.find(gornicy) == bylo.end()) {
    if(dobry(gornicy)) {
      printf("%d\n",ans);
      return 0;
    }
    bylo.insert(gornicy);
    gornicy = F(gornicy);
    ans++;
  }
  printf("-1\n");


}