/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define fi first
#define se second
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) ((1ll << (x)))
#define debug(a, l, r) for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';
const int INF = 1e9;
struct SegmentTree {
int n; vector<int> seg, lazy;
SegmentTree(int _n) : n(_n) {
seg.resize(4 * n + 5, -INF);
lazy.resize(4 * n + 5, -INF);
}
void apply(int id, int x) {
seg[id] = max(seg[id], x);
lazy[id] = max(lazy[id], x);
}
void push(int id) {
if (lazy[id] <= -INF) return;
apply(id << 1, lazy[id]);
apply(id << 1 | 1, lazy[id]);
lazy[id] = -INF;
}
void pull(int id) {
seg[id] = min(seg[id << 1], seg[id << 1 | 1]);
}
void update(int id, int l, int r, int u, int v, int x) {
if (r < u || v < l) return;
if (u <= l && r <= v) {
apply(id, x);
return;
}
push(id);
int mid = (l + r) >> 1;
update(id << 1, l, mid, u, v, x);
update(id << 1 | 1, mid + 1, r, u, v, x);
pull(id);
}
int get(int id, int l, int r, int u, int v) {
if (r < u || v < l) return INF;
if (u <= l && r <= v) return seg[id];
push(id);
int mid = (l + r) >> 1;
int get1 = get(id << 1, l, mid, u, v);
int get2 = get(id << 1 | 1, mid + 1, r, u, v);
return min(get1, get2);
}
void update(int u, int v, int x) {update(1, 1, n, u, v, x);}
int get(int u, int v) {return get(1, 1, n, u, v);}
};
const int MAXN = 5e5 + 5;
int n, m, q;
vector<int> intervals[MAXN];
vector<pii> queries[MAXN];
bitset<MAXN> ans;
void init() {
cin >> n >> m >> q;
for (int i = 1; i <= m; ++i) {
int l, r; cin >> l >> r;
intervals[r].push_back(l);
}
for (int i = 1; i <= q; ++i) {
int l, r; cin >> l >> r;
queries[r].push_back({l, i});
}
}
void solve() {
SegmentTree seg(n);
for (int i = 1; i <= n; ++i) {
for (auto l : intervals[i]) seg.update(l, i, l);
for (auto &qry : queries[i]) {
ans[qry.se] = (seg.get(qry.fi, i) >= qry.fi);
}
}
for (int i = 1; i <= q; ++i)
cout << (ans[i] ? "YES" : "NO") << '\n';
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
