#include "paint.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define Co continue
#define R return
#define Br break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[200005] , a[555555] , b[555555] , ok[200005] , k, l, m, n, o, p;
map < ll , ll > mp[200005];
vll adj[555555] , adj2[555555];
const ll mod = 1e9+7;
str s;
vll c ;
void do_something(ll idxn , ll idxm , ll cnt){
// cout << cnt << " " ;
if(cnt >= m)ok[idxn - m] = 1 ;
if(idxn >= n)R ;
if(!mp[idxm][c[idxn]])R ;
do_something(idxn + 1 , (idxm + 1) % m , cnt + 1) ;
R ;
}
//ll mem(ll i){
//if(i >= n)R 0 ;
//ll &r = dp[i] ;
//if(r != -1)R r ;
//r = mod ;
//if(ok[i]){
//for(ll j = 0 ; j <= m ; j++)r = min(r , mem(i + j) + 1) ;
//}
//R r ;
//}
int minimumInstructions(int N, int M, int K, vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
msdp(dp) ;
c = C ;
n = N ;
m = M ;
for(ll i = 0 ; i < m ; i++){
//cout << i << " " ;
for(ll j = 0 ; j < A[i] ; j++){
adj2[B[i][j]].pb(i) ;
mp[i][B[i][j]]++ ;
}
}
for(ll i = 0 ; i <= n - m ; i++){
if(ok[i])continue ;
for(auto u : adj2[c[i]]){
do_something(i , u , 0) ;
//if(ok[i])break ;
}
//cout << ok[i] << " " ;
}
multiset<ll> se;
for (int i = n - 1; i >= 0; i--) {
dp[i] = mod;
if (ok[i]) {
if (i + m >= n) dp[i] = 0;
else dp[i] = min(dp[i], *se.rbegin() + 1);
}
se.insert(dp[i]);
if (i + m <= n - 1) {
se.erase(se.find(dp[i + m]));
}
}
ll ans = dp[0];
R (ans < mod ? ans : -1) ;
}
