/*
 * Copyright© 2024 Heratino & Nelofus. All rights reserved.
 * author: Heratino & Nelofus
 * Problem: 
 * Tag: 
 * Memory Limit: 
 * Time Limit: 
 * Source: 
 */

// Narcissus & どうか安寧な記憶を

#include <bits/stdc++.h>
using i64 = long long;

//{{{一等星
char buf[1 << 20], *P1 = buf, *P2 = buf;
inline char gc() {
	if (P1 == P2)
		P2 = (P1 = buf) + fread(buf, 1, 1 << 20, stdin);
	return P1 == P2 ? EOF : *P1++;
}

inline i64 read() {
	i64 s = 0, w = 1;
	char c = gc();
	while (!isdigit(c)) {
		if (c == '-')
		   w = -1;
		c = gc();
	}
	while (isdigit(c))
		s = (s << 3) + (s << 1) + (c ^ 48), c = gc();
	return s * w;
}
//}}}

constexpr int N = 2e5 + 10;
constexpr int M = 2 * N;

int n, m, q;
std::pair<int, int> edge[M];
struct queries {
	int l, r;
	int reach;
	int id;
	bool operator < (const queries &t) {
		return r < t.r;
	}
} Q[N];

std::stack<std::pair<int, int>, std::vector<std::pair<int, int>>> stk;
int fa[M], siz[M];
int find(int x) {return x == fa[x] ? x : find(fa[x]);}

bool undo() {
	if (stk.empty())
		return false;
	auto [u, x] = stk.top();
	siz[fa[u]] = x;
	fa[u] = u;
	stk.pop();
	return true;
}

bool merge(int u, int v) {
	int fu = find(u), fv = find(v);
	if (fu == fv)
		return false;
	if (siz[fu] > siz[fv])
		std::swap(fu, fv);
	stk.push(std::make_pair(fu, siz[fv]));
	fa[fu] = fv;
	siz[fv] += siz[fu];
	return true;
}

void divide(int l, int r, int ql, int qr) {
	int mid = l + r >> 1;
	int qmid = Q[mid].r;
	for (int i = std::min(qr, Q[mid].r); i >= ql; i--) {
		const auto &[u, v] = edge[i];
		merge(u + N, v), merge(v + N, u);
		if (find(u) != find(v))
			qmid = i;
		else
			break;
	}
	// 清空并查集
	while (undo());
	Q[mid].reach = qmid;
	if (l < mid)
		divide(l, mid - 1, ql, qmid);
	if (r > mid)
		divide(mid + 1, r, qmid, qr);
}

bool ans[N];
/* 无法忘却的记忆与苍蓝之梦 */
int main() {
#ifdef HeratinoNelofus
	freopen("input.txt", "r", stdin);
#endif
	for (int i = 1; i < M; i++)
		fa[i] = i, siz[i] = 1;

	n = read(), m = read(), q = read();
	for (int i = 1; i <= m; i++) {
		auto &[ll, lr] = edge[i];
		auto &[rl, rr] = edge[i + m];
		ll = read(), lr = read();
		rl = ll, rr = lr;
	}
	for (int i = 1; i <= q; i++) {
		auto &[l, r, rea, id] = Q[i];
		int tl = read(), tr = read();
		
		l = tr + 1;
		r = tl + m - 1;
		id = i;
	}
	std::sort(Q + 1, Q + 1 + q);
	divide(1, q, 1, 2 * m);
	for (int i = 1; i <= q; i++) {
		auto &[l, r, rea, id] = Q[i];
		// 最早的，不是奇环的点
		if (rea > l)
			ans[id] = true;
		else
			ans[id] = false;
	}
	for (int i = 1; i <= q; i++)
		if (ans[i])
			std::cout << "YES" << '\n';
		else
			std::cout << "NO" << '\n';
	return 0;
}