#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int minimumInstructions(int n, int m, int k, std::vector<int> c, std::vector<int> a, std::vector<std::vector<int>> b) {
set <int> s[m];
for (int i = 0; i < m; i++) {
for (auto e : b[i]) {
s[i].emplace(e);
}
}
int dp1[2][m]; memset(dp1, 0, sizeof dp1);
vector <bool> can(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
dp1[i%2][j] = 0;
if (s[j].find(c[i]) != s[j].end()) dp1[i%2][j] = (i == 0 ? 0 : dp1[(i - 1)%2][(j - 1 + m) % m]) + 1;
if (dp1[i%2][j] >= m) can[i] = true;
}
}
// for (int i = 0; i < n; i++) {
// if (can[i]) cout << i << " ";
// }
vector <int> dp(n, 1e9);
multiset <int> ms;
for (int i = m - 1; i < n; i++){
if (i - m - 1 >= m - 1 && can[i - m - 1]) ms.erase(ms.find(dp[i - m - 1]));
if (!can[i]) {
if (i - m - 1 >= m - 1) ms.erase(ms.find(dp[i - m - 1]));
continue;
}
if (i - m < 0) {
dp[i] = 1;
ms.emplace(dp[i]);
continue;
}
if (ms.empty()) return -1;
dp[i] = *ms.begin() + 1;
ms.emplace(dp[i]);
}
return (dp[n-1] == 1e9 ? -1 : dp[n-1]);
}
