#include<bits/stdc++.h>
using namespace std;
const int B=256;
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];
bitset<512> to[50005],to1[64];
int dfn[50005],low[50005],tot,ins[50005],st[50005],top,scc[50005],col;
vector<int> e[50005];
int cnt,po[50005],deg[50005];
queue<int> que;
void Tarjan(int x){
	dfn[x]=low[x]=++tot;
	st[++top]=x,ins[x]=1;
	for(auto e:edge[x])if(!vis[e.first]&&!del[e.first]){
		int y=e.second;
		if(!dfn[y])Tarjan(y),low[x]=min(low[x],low[y]);
		else if(ins[y])low[x]=min(low[x],dfn[y]);
	}
	if(low[x]==dfn[x]){
		col++;int y;
		do{
			y=st[top--];
			scc[y]=col,ins[y]=0;
		}while(y!=x);
	}
}
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;
	}
	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());
		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=1;i<=n;i++)dfn[i]=0;col=tot=0;
		for(int i=1;i<=n;i++)if(!dfn[i])Tarjan(i);
		while(!que.empty())que.pop();
		for(int i=1;i<=col;i++)e[i].clear();
		for(int i=1;i<=m;i++)if(!del[i]&&!vis[i])
			if(scc[ex[i]]!=scc[ey[i]])e[scc[ex[i]]].push_back(scc[ey[i]]),deg[scc[ey[i]]]++;
		for(int i=1;i<=col;i++)if(!deg[i])que.push(i);
		cnt=0;
		while(!que.empty()){
			int x=que.front();que.pop();
			po[++cnt]=x;
			for(int y:e[x])if(!--deg[y])que.push(y);
		}
		assert(cnt==col);
		for(int i=1;i<=col;i++)to[i].reset();
		for(int i=0;i<vec.size();i++)to[scc[vec[i]]].set(i);
		for(int i=col;i>=1;i--)
			for(int y:e[po[i]])to[po[i]]|=to[y];
		for(int i=0;i<vec.size();i++){
			to1[i].reset();
			for(int j=0;j<vec.size();j++)
				if(to[scc[vec[i]]][j])to1[i].set(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[scc[ex[Q[i].x]]][pos[ey[Q[i].x]]-1])
					to1[pos[ex[Q[i].x]]-1].set(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[scc[ex[Q[i].x]]][pos[ey[Q[i].x]]-1])
					to1[pos[ex[Q[i].x]]-1].flip(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);
				bitset<512> now;now.set(S);
				while(!que.empty()){
					int x=que.front();que.pop();
					bitset<512> sta=to1[x]^(to1[x]&now);
					while(sta.any()){
						int y=sta._Find_first();
						sta.flip(y),now.set(y);
						que.push(y);
						if(y==T)break;
					}
					if(now[T])break;
				}
				if(now[T])puts("YES");
				else puts("NO");
			}
		for(int x:vec)pos[x]=0;
	}
	return 0;
}