#include "paint.h"
// author: yanybayev
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define pp pop_back
#define ll long long
#define pb push_back
#define ls(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define wr cout << "------------------------" << endl
int minimumInstructions( int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
set<int> like[M];
for (int i = 0;i<M;++i) {
for (int j = 0;j<A[i];++j) {
like[i].insert(B[i][j]);
}
}
vector<int> isvalid(N, 0);
for (int y = 0;y<=N - M;++y) {
for (int x = 0;x < M;++x) {
int yes = 1;
for (int l = 0;l<M;++l) {
int id1 = (l + x) % M;
int id2 = (l + y);
if (like[id1].find(C[id2]) == like[id1].end()) {
yes = 0;
break;
}
}
if (yes) {
isvalid[y] = 1;
break;
}
}
}
const int INF = 1e9 + 7;
if (!isvalid[0]) {
return -1;
}
vector<int> dp(N, INF);
dp[M - 1] = 1;
for (int y = 1;y<=N - M;++y) {
if (!isvalid[y]) continue;
for (int i = y - 1;i >= y - M;--i) {
dp[y + M - 1] = min(dp[y + M - 1], dp[i + M - 1] + 1);
}
}
if (dp[N - 1] == INF) dp[N - 1] = -1;
return dp[N - 1];
}
