/*
We just need to check for each length K segment whether there exist a way to color them or not.
*/
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
// f(k) = 1 subtask
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
vector<int> color_contractor[K];
for (int i = 0; i < M; i++) {
for (int j : B[i]) {
color_contractor[j].push_back(i);
}
}
int cnt = 1, ans = 0;
for (int i = 1; i < N; i++) {
if (color_contractor[C[i]][0] - color_contractor[C[i-1]][0] == 1
|| (color_contractor[C[i]][0] == 0 && color_contractor[C[i-1]][0] == M-1)) {
cnt++;
} else {
if (cnt < M) return -1;
ans += (cnt+M-1)/M;
cnt = 1;
}
}
if (cnt < M) return -1;
ans += (cnt+M-1)/M;
cnt = 1;
return ans;
}
