#include <bits/stdc++.h>
#define ar array
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const int maxn = 1e5 + 5;
struct segment_tree {
int n;
vector<int> tree, lazy;
segment_tree(int _n) : n(_n), tree(4*n), lazy(4*n) {}
void push(int u, int tl, int tr) {
if(!lazy[u]) return ;
tree[u] = max(tree[u], lazy[u]);
if(tl != tr) {
lazy[2*u] = max(lazy[2*u], lazy[u]);
lazy[2*u+1] = max(lazy[2*u+1], lazy[u]);
}
lazy[u] = 0;
}
void update(int u, int tl, int tr, int l, int r) {
push(u, tl, tr);
if(tl > r || l > tr) return ;
if(l <= tl && tr <= r) {
lazy[u] = l;
push(u, tl, tr);
return ;
}
int tm = (tl + tr) / 2;
update(2*u, tl, tm, l, r);
update(2*u+1, tm+1, tr, l, r);
tree[u] = min(tree[2*u], tree[2*u+1]);
}
int query(int u, int tl, int tr, int l, int r) {
if(tl > r || l > tr) return 1e9;
push(u, tl, tr);
if(l <= tl && tr <= r) return tree[u];
int tm = (tl + tr) / 2;
return min(query(2*u, tl, tm, l, r), query(2*u+1, tm+1, tr, l, r));
}
void update(int l, int r) { update(1, 1, n, l, r); }
int query(int l, int r) { return query(1, 1, n, l, r); }
};
signed main() {
ios_base::sync_with_stdio(false);
cout.tie(0); cin.tie(0);
int n, m, q; cin >> n >> m >> q;
vector<int> add[n+1];
vector<pii> qus[n+1];
for(int i=1; i<=m; i++) {
int l, r; cin >> l >> r;
add[r].push_back(l);
}
for(int i=1; i<=q; i++) {
int l, r; cin >> l >> r;
qus[r].push_back({ l, i });
}
vector<int> ans(q+1);
segment_tree sgt(n);
for(int r=1; r<=n; r++) {
for(int l : add[r]) sgt.update(l, r);
for(auto [l, id] : qus[r])
ans[id] = (sgt.query(l, r) >= l);
}
for(int i=1; i<=q; i++)
cout << (ans[i] ? "YES" : "NO") << '\n';
}
