#include "paint.h"
#include <bits/stdc++.h>
#include <stdio.h>
#define __Shibae__ signed main()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fiopen(Path) freopen(Path".INP", "r", stdin); freopen(Path".OUT", "w", stdout);
#define fipen(Path) freopen(Path".INP", "r", stdin);
#define sz(s) (int)s.size()
#define all(x) x.begin(), x.end()
#define maxHeap priority_queue<int>
#define minHeap priority_queue<int, vector<int>, greater<int>>
#define getBit(x, k) (((x) >> (k)) & 1)
#define MASK(i) (1LL << (i))
#define SQR(x) (1LL * ((x) * (x)))
#define db double
#define ld long double
#define ui unsigned int
#define ll long long
#define ii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define FOR(i, a, b) for(int i = a, _b = b; i <= _b; i += 1)
#define FOD(i, a, b) for(int i = a, _b = b; i >= _b; i -= 1)
#define REP(i, a) for(int i = 0, _a = a; i < _a; i++)
#define pb push_back
#define fau(u, a) for(auto &u : a)
#define debug return cout << "debug", void();
using namespace std;
const ll mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);
const int MAX = 5e5+5;
const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll l, ll r)
{
return uniform_int_distribution<ll>(l, r)(rd);
}
template<class SHIBA, class ENGINE>
bool minimize(SHIBA &x, const ENGINE y)
{
if(x > y)
{
x = y;
return true;
}
else return false;
}
template<class SHIBA, class ENGINE>
bool maximize(SHIBA &x, const ENGINE y)
{
if(x < y)
{
x = y;
return true;
}
else return false;
}
/* Template by: Nguyen Nhat Anh from Luong Van Chanh High School for the gifted */
/* From Min Tuoi with love */
/** TRY HARD **/
/** ORZ **/
/* -----------------[ MAIN CODE ]----------------- */
int minimumInstructions(int N, int M, int K, std::vector<int> C,
std::vector<int> A, std::vector<std::vector<int>> B)
{
vector<vector<int>> lis(K+1);
REP(j, M) fau(x, B[j]) lis[x].pb(j);
vector<int> seq(N+1, 0);
vector<int> f(M+1, 0);
vector<int> lst(M+1, -1);
REP(i, N)
{
int c = C[i];
fau(j, lis[c])
{
int k = (((j - i) % M) + M) % M;
if (lst[k] == i-1) f[k]++;
else f[k] = 1;
lst[k] = i;
if (f[k] >= M) seq[i + 1] = 1;
}
}
vector<int> dp(N+3, INF);
dp[0] = 0;
deque<int> dq;
dq.push_back(0);
FOR(i, 1, N)
{
if (dq.front() < i - M) dq.pop_front();
if (seq[i]) dp[i] = dp[dq.front()] + 1;
while(dq.size() && dp[dq.back()] >= dp[i]) dq.pop_back();
dq.push_back(i);
}
return (dp[N] >= INF ? -1 : dp[N]);
}
#ifdef SHABI
__Shibae__
{
IOS
fipen("test")
int n, m, k;
cin >> n >> m >> k;
vector<int> c(n), a(m);
vector<vector<int>> b(m);
REP(i, n) cin >> c[i];
REP(i, m)
{
cin >> a[i];
REP(j, a[i])
{
int x; cin >> x;
b[i].pb(x);
}
}
cout << minimumInstructions(n, m, k, c, a, b);
return 0;
}
#endif
