#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#define mod 1000000007
ofstream fout(".out");
ifstream fin(".in");
vector<int> node[100001];
int d[100001];
bool b[100001];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, q;
cin >> n >> m >> q;
for(int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
node[v].push_back(u);
}
if(q == 1) {
int t, sz;
cin >> t >> sz;
for(int i = 0; i < sz; i++) {
int x;
cin >> x;
b[x] = 1;
}
priority_queue<pair<int, int>> pq;
pq.push({0, t});
d[t] = 0;
int ans = -1;
while(!pq.empty()) {
pair<int, int> p = pq.top();
pq.pop();
int x = p.second;
int cost = p.first;
if(cost < d[x])
continue;
if(!b[x])
ans = max(ans, d[x]);
for(int i : node[x]) {
if(cost + 1 > d[i]) {
d[i] = cost + 1;
pq.push({cost + 1, i});
}
}
}
cout << ans << "\n";
}
return 0;
}
