#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
using i32 = long long;
#define all(a) (a).begin(), (a).end()
#define open(x) if(fopen(#x ".inp", "r")) {freopen(#x ".inp", "r", stdin); freopen(#x ".out", "w", stdout);}
template<class X, class Y> bool mimi(X &x, const Y &y) {if(x > y) {x = y; return 1;} return 0;}
template<class X, class Y> bool mama(X &x, const Y &y) {if(x < y) {x = y; return 1;} return 0;}
const i32 N = 5e5 + 5;
const i32 M = 1000000007;
const i32 inf = 1000000009;
const i32 infll = (i32)1000000000000000018;
struct STN {i32 val;};
struct SegmentTree {
i32 n;
vector<STN> node;
SegmentTree(i32 _n = 0) {
if (_n) init(_n);
}
void init(i32 _n) {
n = _n;
node.assign(4 * n + 5, {inf});
}
STN merge(const STN &a, const STN &b) {
return {max(a.val, b.val)};
}
void update(i32 ql, i32 qr) {update(1, 1, n, ql, qr);}
void update(i32 id, i32 l, i32 r, i32 ql, i32 qr) {
if (r < ql || l > qr) return;
if (ql <= l && r <= qr) {
node[id].val = min(node[id].val, qr);
return;
}
i32 mid = (l + r) >> 1;
update(id << 1, l, mid, ql, qr);
update(id << 1 | 1, mid + 1, r, ql, qr);
STN merged = merge(node[id << 1], node[id << 1 | 1]);
node[id].val = min(node[id].val, merged.val);
}
bool get(i32 ql, i32 qr) {return get(1, 1, n, ql, qr);}
bool get(i32 id, i32 l, i32 r, i32 ql, i32 qr) {
if (r < ql || l > qr) return true;
if (ql <= l && r <= qr)
return node[id].val <= qr;
i32 mid = (l + r) >> 1;
return get(id << 1, l, mid, ql, qr) && get(id << 1 | 1, mid + 1, r, ql, qr);
}
};
vector<vector<i32>> a(N);
vector<vector<pair<i32, i32>>> qq(N);
void sad(i32 testID) {
i32 n, m, q;
cin >> n >> m >> q;
for (i32 i = 0; i < m; i++) {
i32 l, r;
cin >> l >> r;
a[l].push_back(r);
}
for (i32 i = 0; i < q; i++) {
i32 s, e;
cin >> s >> e;
qq[s].push_back({e, i});
}
SegmentTree st(n);
vector<string> res(q);
for (i32 i = n; i >= 1; i--) {
for (i32 r : a[i]) st.update(i, r);
for (auto it : qq[i])
res[it.second] = st.get(i, it.first) ? "YES" : "NO";
}
for (i32 i = 0; i < q; i++) cout << res[i] << endl;
}
signed main() {
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
open(task)
i32 t = 1;
// cin >> t;
for(i32 testID = 1; testID <= t; testID++) {
// cout << "Case #" << testID << ":\n";
sad(testID);
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
// cerr << endl << "Time measured: " << elapsed.count() * 1e-9 << " seconds." << endl;
return 0;
}
