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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
#include <cstdio>
#include <algorithm>
#include <vector>
#include <list>
#include <set>

typedef unsigned long long ull;

using namespace std;

ull _A[100],_B[100],M[1003][100];
int O[ 1003 ],J[ 1003 ];
list<int> L[ 1003 ];
set<int> R[1003];

void failed() {
    printf("-1\n");
    exit( 0 );
}

/*ull nwd(ull a, ull b) {
    if (a&&b) return nwd( b, a%b );
    return a+b;
}*/

/*ull wynik;
ull cut_mod;
set<ull> cut_mod_set;
int mod_num;
ull mod_tab[ 1003 ];*/

/*void req_lookup( ull a, int m ) {
    if ( m<mod_num ) {
        ull add = ;
        ull up = ;
        ull mod = ;
        auto &lookup_set = ;
        for ( ull i = a; i<=up; i+=add )
            if (lookup_set.find(i%mod)!=lookup_set.end())
               req_lookup( i, m+1 );
    } else {
        ull mod = cut_mod;
        ull up = ;
        ull add = ;
        for ( ull i = a; i<=up; i+=add )
            if ( i%cut_mod ) {
                wynik = max()
            }
    }
}*/

int main() {
    int n,b,r;
    scanf("%d%d%d",&n,&b,&r);
    int n_div = (n+63)/64;
    for ( int i=0; i<n+64; i++ )
        for ( int j=0; j<n_div; j++ ) M[i][j]=0;
    for ( int i=0; i<n; i++ ) {
        char CC[1003];
        scanf("%s",CC);
        for ( int j=0; j<n; j++ )
            if ( CC[j] == '1' ) {
                M[i][j/64] |= ((ull)1)<<(j%64);
            }
    }
    for ( int i=0; i<n_div; i++ ) _A[i]=0;
    for ( int i=0; i<r; i++ ) {
        int aa;
        scanf( "%d", &aa ); aa--;
        _A[aa/64] |= ((ull)1)<<(aa%64);
    }
    for ( int i=0; i<n; i++ ) J[i]=0;
    int move;
    ull *A=_A; ull *B=_B;
    int max_move = 2*n*n+3*n;
    for ( move=1; move<=max_move; move++ ) {
        //for ( int i=0; i<n_div; i++ ) printf("%016llX",A[i]); printf("\n");
        for ( int i=0; i<n_div; i++ ) B[i]=0;
        for ( int i=0; i<n_div; i++ )
            for ( int ii=0; ii<64; ii++ ) if (A[i]&(((ull)1)<<ii))
                for ( int j=0; j<n_div; j++ ) B[j]|=M[i*64+ii][j];
        //printf("  "); for ( int i=0; i<n_div; i++ ) printf("%016llX",B[i]); printf("\n");
        int rr = 1;
        for ( int i=0; i<n_div; i++ )
            for ( int ii=0; ii<64; ii++ )
               if ((B[i]&(((ull)1)<<ii))&&(i*64+ii>=b)) {
                   rr=0;
                   L[i*64+ii].push_back( move );
               }
        if ( rr ) { printf("%d\n",move); exit(0); }
        for ( int i=b; i<n; i++ )
            while ( !L[i].empty() && L[i].front()<move-3*n ) L[i].pop_front();
        swap( A, B );
    }

    /*for ( int i=0; i<n; i++ ) {
        for ( const int &j : L[i] ) printf("%d ",j);
        printf("\n");
    }*/
    //return 0;

    /*int n = 100;
    for ( int i=0; i<4; i++ ) {
        L[1].push_back( i*4+1 );
        L[1].push_back( i*4+3 );
        L[2].push_back( i*5+0 );
    }*/

    for ( int i=0; i<n; i++ ) if (!(L[i].empty())) {
        int iltmp = 0;
        int tmp[ 1003 ];
        for ( int &j : L[i] ) tmp[iltmp++] = j;
        int d,pp;
        for ( d=1; d<=n+1; d++ ) {
            pp = iltmp-1;
            int aa = tmp[pp]%d;
            pp--;
            while ( pp >=0 && tmp[pp]%d != aa ) pp--;
            if ( pp<0  ) continue;
            pp++;
            pp = iltmp-pp;
            int yy = 1;
            for ( int j=iltmp-pp-1; yy&&j>=0; j-- )
                if ( tmp[j]%d!=tmp[j+pp]%d || (tmp[j+pp]-tmp[j]>d) ) yy=0;
            if ( yy ) break;
        }
        //printf("%d %d\n",i,d);
        if ( d > n ) failed();
        if ( d == 1 && iltmp ) failed();
        int DD[1003],ildd=0;
        int dd = d, wskdd = 2;
        while ( wskdd<=d ) {
            if (!(dd%wskdd)) {
                int a = 1;
                while (!(dd%wskdd))
                      { a*=wskdd; dd/=wskdd; }
                DD[ildd++]=a;
            }
            wskdd++;
        }
        for ( int j=0; j<pp; j++ ) {
            for ( int k=0; k<ildd; k++ )
                R[DD[k]].insert( tmp[j]%DD[k] );
        }
    }
    /*printf("\n");
    for ( int i=0; i<n; i++ ) if ( R[i].size() ) {
        printf("%d    ",i);
        for ( const int &j : R[i] ) printf("%d ",j); printf("\n");
    } printf("\n");*/

    for ( int i=n; i>=2; i-- ) if ( R[i].size() ) {
        int dd = i;
        int md = 2;
        while ( dd%md ) md++;
        if ( dd%(md*md) ) continue;
        while (!(dd%md)) dd/=md;
        if ( dd == 1 ) {
            for ( int j=md; j<i; j*=md ) if ( R[j].size() ) {
                int st = i/j;
                for ( const int &r : R[j] ) {
                    for ( int k=0; k<st; k++ )
                        R[i].insert( k*j+r );
                }
                R[j].clear();
            }
        }
    }

    ull mul=1,wynik=0;
    for ( int i=0; i<n; i++ ) if (R[i].size()) {
        if ( R[i].size() == i ) failed();
        int wsk = 0;
        for ( const int &j : R[i] ) {
            if ( j != wsk ) break;
            wsk++;
        }
        
        int d = i;
        int r = wsk;
        while ( (int)(wynik%d) != r ) wynik += mul;
        mul *= d;
    }

    while ( wynik < (ull)max_move ) wynik += mul;
    printf("%llu\n",wynik);
    return 0;
}