#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
const int B=32;
int n,m,q;
vector<pair<int,int> > edge[50005];
int ex[100005],ey[100005];
struct Query{
	int opt,x,y;
}Q[100005];
vector<int> vec;
int pos[50005];
int del[100005],vis[100005];
ull to[50005],to1[64];
queue<int> que;
int id[50005],cnt,po[50005],deg[50005];
bool cmp(int x,int y){return id[x]<id[y];}
int main(){
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=m;i++){
		int x,y;scanf("%d%d",&x,&y);
		edge[x].push_back(make_pair(i,y));
		ex[i]=x,ey[i]=y;deg[y]++;
	}
	for(int i=1;i<=n;i++)if(!deg[i])que.push(i);
	while(!que.empty()){
		int x=que.front();que.pop();
		po[++cnt]=x,id[x]=cnt;
		for(auto e:edge[x])if(!--deg[e.second])que.push(e.second);
	}
	assert(cnt==n);
	for(int i=1;i<=q;i++){
		scanf("%d",&Q[i].opt);
		if(Q[i].opt==1)scanf("%d",&Q[i].x);
		else scanf("%d%d",&Q[i].x,&Q[i].y);
	}
	for(int ql=1,qr=B;ql<=q;ql+=B,qr+=B){
		qr=min(qr,q);vec.clear();
		for(int i=ql;i<=qr;i++)
			if(Q[i].opt==1)vec.push_back(ex[Q[i].x]),vec.push_back(ey[Q[i].x]),vis[Q[i].x]=1;
			else vec.push_back(Q[i].x),vec.push_back(Q[i].y);
		sort(vec.begin(),vec.end(),cmp);
		vec.erase(unique(vec.begin(),vec.end()),vec.end());
		for(int i=0;i<vec.size();i++)pos[vec[i]]=i+1;
		for(int i=n;i>=1;i--){
			int x=po[i];
			if(pos[x])to[x]=1ull<<pos[x]-1;
			else to[x]=0;
			for(auto e:edge[x])if(!del[e.first]&&!vis[e.first])to[x]|=to[e.second];
		}
		for(int i=0;i<vec.size();i++){
			to1[i]=0;
			for(int j=0;j<vec.size();j++)
				if(to[vec[i]]&(1ull<<j))to1[i]|=1ull<<j;
		}
		for(int i=ql;i<=qr;i++)if(Q[i].opt==1)if(vis[Q[i].x]){
			vis[Q[i].x]=0;
			if(!del[Q[i].x])
				if(!(to[ex[Q[i].x]]&(1ull<<pos[ey[Q[i].x]]-1)))
					to1[pos[ex[Q[i].x]]-1]|=1ull<<pos[ey[Q[i].x]]-1;
		}
		for(int i=ql;i<=qr;i++)
			if(Q[i].opt==1){
				del[Q[i].x]^=1;
				if(!(to[ex[Q[i].x]]&(1ull<<pos[ey[Q[i].x]]-1)))
					to1[pos[ex[Q[i].x]]-1]^=1ull<<pos[ey[Q[i].x]]-1;
			}else{
				while(!que.empty())que.pop();
				int S=pos[Q[i].x]-1,T=pos[Q[i].y]-1;
				que.push(S);
				ull now=1ull<<S;
				while(!que.empty()){
					int x=que.front();que.pop();
					ull sta=to1[x]^(to1[x]&now);
					while(sta){
						int y=__builtin_ctzll(sta);
						sta^=1ull<<y,now|=1ull<<y;
						que.push(y);
						if(y==T)break;
					}
					if(now&(1ull<<T))break;
				}
				if(now&(1ull<<T))puts("YES");
				else puts("NO");
			}
		for(int x:vec)pos[x]=0;
	}
	return 0;
}