// soab
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define nl '\n'
#define fi first
#define se second
void io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
const int MAXN = 5 * 1e5 + 1;
int n, m, q;
pair<int,int> ctain[MAXN];
vector<pair<int,int>> query;
bool check(int l, int r) {
int i = 0;
while(i < m && ctain[i].fi < l) i++;
if(i == m || ctain[i].fi != l) return 0;
int cur = l - 1;
for(i; i < m; i++) {
if(ctain[i].fi > cur + 1) return 0;
if(ctain[i].se <= r) {
cur = max(cur, ctain[i].se);
}
if(cur == r) return 1;
}
return cur == r;
}
void sub2() {
sort(ctain, ctain + m);
for(auto [l, r] : query) {
cout << (check(l, r)? "YES" : "NO") << nl;
}
}
void sub4() {
sort(ctain, ctain + m, [](const pair<int, int>& a, const pair<int, int>& b) {
return a.se < b.se;
});
vector<bool> ans(n + 1, 0);
int cur = 0;
for(int i = 0; i < m; i++) {
if(ctain[i].fi <= cur + 1) {
ans[ctain[i].se] = 1;
cur = ctain[i].se;
}
}
for(auto [l, r] : query) {
cout << (ans[r]? "YES" : "NO") << nl;
}
}
signed main() {
io();
bool subtask4 = 1;
cin >> n >> m >> q;
for(int i = 0; i < m; i++) {
cin >> ctain[i].fi >> ctain[i].se;
}
for(int i = 0; i < q; i++) {
int x, y; cin >> x >> y;
query.push_back({x, y});
subtask4 &= x == 1;
}
if(subtask4) {
sub4();
} else {
sub2();
}
return 0;
}
