#include<bits/stdc++.h>
using namespace std ;
const int N = 505 ;
const int M = 5e4+5 ;
const int K = 1e5+5 ;
int arr[N][K] , brr[N] ;
set<int> st ;
int minimumInstructions(int n , int m , int k , vector<int> c , vector<int> a , vector<vector<int>> b){
for(int i=0 ; i<m ; i++){
for(int j=0 ; j<a[i] ; j++) arr[i][b[i][j]]=1 ;
}
for(int i=0 ; i<=n-m ; i++){
for(int j=0 ; j<m ; j++){
bool flag = true ;
for(int l=0 ; l<m && flag ; l++){
if(!arr[(j+l)%m][c[i+l]]) flag = false ;
}
if(flag){
st.insert(i) ;
break ;
}
}
}
int ri = 0 , cnt = 0 ;
while(ri<n-1){
auto it = st.upper_bound(ri) ;
if(it==st.begin()) return -1 ;
it-- ; cnt++ ;
if(*it+m<=ri) return -1 ;
ri = *it+m ;
}
return cnt ;
}
/*
int main(){
// cout << minimumInstructions(8, 3, 5, {3, 3, 1, 3, 4, 4, 2, 2}, {3, 2, 2}, {{0, 1, 2}, {2, 3}, {3, 4}}) << '\n' ;
// cout << minimumInstructions(5, 4, 4, {1, 0, 1, 2, 2}, {2, 1, 1, 1}, {{0, 1}, {1}, {2}, {3}}) << '\n' ;
// cout << minimumInstructions(8, 3, 5, {2, 3, 4, 0, 3, 0, 3, 4}, {3, 1, 1}, {{0, 1, 2}, {3}, {4}}) << '\n' ;
// cout << minimumInstructions(5, 4, 4, {1, 0, 1, 2, 2}, {1, 1, 1, 1}, {{0}, {1}, {2}, {3}}) << '\n' ;
return 0 ;
}
*/
