/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
#include "paint.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
const ll INF = 1e18+7;
const int lg = 20;
//const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
mt19937 rng(1488);
ll randll(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
int minimumInstructions(int n, int m, int k, vi c, vi a, vector<vi> b) {
vll dp(n+7, INF);
dp[0] = 0;
vector<unordered_set<ll>> v(m);
for (int i = 0; i < m; i ++) {
for (int j : b[i]) {
v[i].insert(j);
}
}
for (int i = m; i <= n; i ++) {
ll minl = INF;
for (int j = i-m; j < i; j ++) {
minl = min(minl, dp[j]);
}
for (int j = 0; j < m; j ++) {
ll x = j, y = i-1;;
bool q = 1;
for (int k = 0; k < m; k ++, x = (x-1+m)%m, y --) {
if (v[x].find(c[y]) == v[x].end()) {
q = 0;
break;
}
}
if (q) {
dp[i] = minl+1;
break;
}
}
}
if (dp[n] >= INF) return -1;
return dp[n];
}
/*int main(){
speed;
srand(time(0));
cout << minimumInstructions(5, 4, 4, {1, 0, 1, 2, 2}, {2, 1, 1, 1}, {{0, 1}, {1}, {2}, {3}}) << endl;
}*/
