#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define fi first
#define se second
using namespace std;
const int N=1e5+10;
const int P=1e4+10;
const int inf=0x3f3f3f3f3f3f3f3f;
int n,m,q;
vector<int> G[2*N];
int dis[N*2];
int vis[N*2];
void dij()
{
	memset(dis,0x3f,sizeof(dis));
	dis[1]=0;
	priority_queue<pair<int,int>> q;
	q.push({0,1});
	while(!q.empty())
	{
		int u=q.top().se;
		q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(auto v:G[u])
		{
			if(dis[v]>dis[u]+1) dis[v]=dis[u]+1,q.push({-dis[v],v});
		}
	}
}
signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(false);
	cin>>n>>m>>q;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		G[u].push_back(v+n);
		G[v+n].push_back(u);
		G[u+n].push_back(v);
		G[v].push_back(u+n);
	}
	dij();
	while(q--)
	{
		int x,l;
		cin>>x>>l;
		if(l>=dis[x+(l&1)*n]) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}