#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2
const int MAXN=5e5+5;
const int MOD=1e9+7;
const int INF=1e18;
int n,m,q;
vii ar;
vi tut[MAXN], tut2[MAXN];
int yakin[MAXN];
bool ans[MAXN];
void dnc(vector<pair<pii,int>> qq,int l=1,int r=n){
if(qq.empty()) return;
if(l==r){
bool f=false;
for(auto el:tut[l]){
if(el==l) f=true;
}
for(auto el:qq){
int ind=el.se;
ans[ind]=f;
}
return;
}
//mid ile ortadan ikiye ayrılanlar için ans hesapla
int sonra,once;
vii vec;
for(int i=mid;i>=l;i--){
yakin[i]=INF;
sonra=INF;
once=-INF;
for(auto el:tut[i]){
if(el>r) continue;
if(el>=mid) sonra=min(sonra,el);
else once=max(once,el);
}
if(sonra>=mid) yakin[i]=min(yakin[i],sonra);
while(!vec.empty() and (vec.back().fi<=once+1 or vec.back().se>yakin[i])){
yakin[i]=min(yakin[i],vec.back().se);
vec.pop_back();
}
vec.pb({i,yakin[i]});
}
vec.clear();
FORE(i,mid+1,r+1){
yakin[i]=-INF;
sonra=-INF;
once=INF;
for(auto el:tut2[i]){
if(el<l) continue;
if(el<=mid+1) sonra=max(sonra,el);
else once=min(once,el);
}
if(sonra<=mid+1) yakin[i]=max(yakin[i],sonra);
while(!vec.empty() and (once-1<=vec.back().fi or vec.back().se<yakin[i])){
yakin[i]=max(yakin[i],vec.back().se);
vec.pop_back();
}
vec.pb({i,yakin[i]});
}
vector<pair<pii,int>> sol,sag;
FOR(i,qq.size()){
int bas=qq[i].fi.fi;
int son=qq[i].fi.se;
int ind=qq[i].se;
if(bas>=mid+1) sag.pb(qq[i]);
else if(son<=mid) sol.pb(qq[i]);
else{
//cevabını hesapladım
if(yakin[bas]<=son and yakin[son]>=bas) ans[ind]=true;
else ans[ind]=false;
}
}
dnc(sol,l,mid);
dnc(sag,mid+1,r);
}
bool mm(pii a,pii b){
return a.se<b.se;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//freopen("out.txt","w",stdout);
cin>>n>>m>>q;
ar.resize(m+1);
FORE(i,1,m+1){
cin>>ar[i].fi>>ar[i].se;
}
sort(all(ar),mm);
FORE(i,1,m+1){
tut[ar[i].fi].pb(ar[i].se);
tut2[ar[i].se].pb(ar[i].fi);
}
vector<pair<pii,int>> qq;
FORE(i,1,q+1){
int l,r;
cin>>l>>r;
qq.pb({{l,r},i});
}
dnc(qq);
FORE(i,1,q+1){
if(ans[i]) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
