#include <iostream>
#include <queue>
using namespace std;
struct state{
int u,pu,v,pv;
};
int n,m,t,p[200001],f[200001],d[200001],a[200001],b[200001],l,r;
queue <state> q;
pair <int, int> findp(int i){
int x=0;
while (p[i]!=i){
x^=f[i];
i=p[i];
}
return {i,x};
}
bool unite(int i, int j){
auto pi=findp(i),pj=findp(j);
if (pi.first==pj.first)
return (pi.second!=pj.second);
q.push({pi.first,pj.first});
p[pi.first]=pj.first;
f[pi.first]=pi.second^pj.second^1;
return true;
}
void rollback(int sz){
while (q.size()>sz){
state s=q.front();
q.pop();
p[s.u]=s.pu;
p[s.v]=s.pv;
}
}
void cal(int l, int r, int optl, int optr){
if (l>r)
return;
int mid=(l+r)>>1,ch=1;
int s=q.size();
for (int i=max(l,1);i<=mid;i++)
if (!unite(a[i],b[i])){
ch=0;
break;
}
if (ch){
int s2=q.size();
d[mid]=0;
for (int i=min(optr,m);i>=max(optl,mid+1);i++)
if (!unite(a[i],b[i])){
d[mid]=i;
break;
}
rollback(s2);
cal(mid+1,r,d[mid],optr);
}
rollback(s);
for (int i=d[mid]+1;i<=optr;i++)
unite(a[i],b[i]);
cal(l,mid-1,optl,d[mid]);
rollback(s);
}
int main(){
ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
cin >> n >> m >> t;
for (int i=1;i<=n;i++)
p[i]=i;
for (int i=1;i<=m;i++){
cin >> a[i] >> b[i];
d[i]=m+1;
}
cal(0,m,1,m+1);
while (t--){
cin >> l >> r;
cout << (d[l-1]>=r+1?"YES\n":"NO\n");
}
}
