#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int SZ = 1 << 19;
vector<int> SR[SZ];
vector<pii> QR[SZ];
int ans[SZ];

struct Seg {
	pii T[SZ << 1];
	pii Merge(pii a, pii b) {
		if (!a.second || !b.second) return max(a, b);
		// cout << a.first << ' ' << a.second << " + " << b.first << ' ' << b.second << " = ";
		if (a.second + 1 < b.first) {
			// cout << a.first << ' ' << a.second << '\n';
			return a;
		}

		// cout << a.first << ' ' << max(a.second, b.second) << '\n';
		return {a.first, max(a.second, b.second)};
	}
	Seg() {
		for (int i = 1; i <= SZ; ++i) T[i + SZ - 1] = {i, 0};
		for (int i = SZ - 1; i > 0; --i) T[i] = Merge(T[i * 2], T[i * 2 + 1]);
	}
	void Update(int i, int n) {
		i += SZ - 1;
		T[i].first = i - SZ + 1;
		T[i].second = max(T[i].second, n);
		// cout << "upd: " << T[i].first << ' ' << T[i].second << '\n';
		while (i >>= 1) T[i] = Merge(T[i * 2], T[i * 2 + 1]);
	}
	pii Query(int L, int R, int sL = 1, int sR = SZ, int n = 1) {
		if (R < sL || sR < L) return {0, 0};
		if (L <= sL && sR <= R) return T[n];
		int mid = (sL + sR) >> 1;
		return Merge(Query(L, R, sL, mid, n * 2), Query(L, R, mid + 1, sR, n * 2 + 1));
	}
} T;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int M, N, Q;
	cin >> M >> N >> Q;
	for (int i = 1; i <= N; ++i) {
		int l, r;
		cin >> l >> r;
		SR[r].push_back(l);
	}
	for (int i = 1; i <= Q; ++i) {
		int l, r;
		cin >> l >> r;
		QR[r].emplace_back(l, i);
	}

	for (int i = 1; i <= M; ++i) {
		for (int l : SR[i]) T.Update(l, i);
		for (auto [l, id] : QR[i]) {
			
			pii p = T.Query(l, i);
			// cout << l << ' ' << i << " / " << p.first << ' ' << p.second << '\n';
			ans[id] = (p.second == i);
		}
	}

	for (int i = 1; i <= Q; ++i) cout << (ans[i] ? "YES" : "NO") << '\n';
	return 0;
}