#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
const int N = 5e5+5;
int n,m,q,st[4*N],ans[N];
pii a[N];
vector<pii>qr[N];
void update(int id, int l, int r, int u, int v){
if(l > v || r < u) return;
if(l >= u && r <= v){
st[id] = min(st[id],v);
return;
}
int mid = (l+r)/2;
update(2*id,l,mid,u,v);
update(2*id+1,mid+1,r,u,v);
st[id] = min(st[id],max(st[2*id],st[2*id+1]));
}
int get(int id, int l, int r, int u, int v){
if(l > v || r < u) return 1;
if(l >= u && r <= v) return st[id] <= v;
int mid = (l+r)/2;
return min(get(2*id,l,mid,u,v),get(2*id+1,mid+1,r,u,v));
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> q;
for(int i = 1; i <= 4*n; i++) st[i] = 1e9;
for(int i = 1; i <= m; i++) cin >> a[i].fi >> a[i].se;
for(int i = 1; i <= q; i++){
int l,r;
cin >> l >> r;
qr[l].push_back({r,i});
}
sort(a+1,a+m+1);
int cur = m;
for(int i = n; i >= 1; i--){
while(cur > 0 && a[cur].fi >= i){
update(1,1,n,a[cur].fi,a[cur].se);
cur--;
}
for(auto[r,id]: qr[i]) ans[id] = get(1,1,n,i,r);
}
for(int i = 1; i <= q; i++){
if(ans[i] == 0) cout << "NO" << "\n";
else cout << "YES" << "\n";
}
}
