#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include <time.h>
#endif
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
using namespace std;
using namespace __gnu_pbds;
typedef pair<int, int> ii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
!is_same<T_container, string>::value,
typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
os << '{';
string sep;
for (const T &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;
int minimumInstructions(int n, int m, int k, vi c, vi a, vvi b) {
vvi by_col(k); for (int i=0; i<m; i++) for (int col : b[i]) by_col[col].push_back(i);
for (int i=0; i<n; i++) if (by_col[c[i]].empty()) return -1;
int curr = (by_col[c[0]][0] + 1) % m;
for (int i = 1; i < n; i++) {
if (by_col[c[i]].empty() || by_col[c[i]][0] != curr)
return -1;
curr = (curr + 1) % m;
}
return ((n + m - 1) / m);
// vvi bb(m, vi(k));
// for (int i=0; i<m; i++) {
// for (int col : b[i]) bb[i][col] = 1;
// }
//
// vvi by_col(k); for (int i=0; i<m; i++) for (int col : b[i]) by_col[col].push_back(i);
//
// vb poss(n);
// for (int st=0; st+m<=n; st++) {
// for (int cont : by_col[c[st]]) {
// bool f = 1;
// int cont_id = cont;
// for (int j=st; j<st+m; j++) {
// if (!bb[cont_id][c[j]]) {
// f = 0;
// break;
// }
//
// cont_id = (cont_id + 1) % m;
// }
//
// if (f) {
// poss[st] = 1;
// break;
// }
// }
// }
//
// vb can(n); for (int i=0; i<n; i++) if (poss[i]) {
// for (int j=i; j<i+m; j++) can[j] = 1;
// }
// for (int i=0; i<n; i++) if (!can[i]) {
// return -1;
// }
//
// int ans = 0;
// int idx = 0;
// while (idx < n) {
// ans++;
// while (!poss[idx]) idx--;
// idx += m;
// }
//
// return ans;
}
#ifdef DEBUG
void solve() {
int n, m, k; cin >> n >> m >> k;
vi c(n); for (int &x : c) cin >> x;
vi a(m); vvi b(m);
for (int i=0; i<m; i++) {
cin >> a[i];
for (int j=0; j<a[i]; j++) {
int x; cin >> x;
b[i].push_back(x);
}
}
cerr << n << " " << m << " " << k << "\n";
cerr << c << "\n";
cerr << a << "\n";
cerr << b << "\n";
cout << minimumInstructions(n, m, k, c, a, b) << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
clock_t start = clock();
int test_cases = 1;
/* cin >> test_cases; */
while (test_cases--)
solve();
cerr << fixed << setprecision(10)
<< "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
<< "s\n";
return 0;
}
#endif
