#include <bits/stdc++.h>
#define pb emplace_back
#define SZ(x) ((int)x.size())
#define fi first
#define se second
#define FOR(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define FORLL(i, a, b) for (ll i = a, _b = b; i <= _b; ++i)
#define FORDLL(i, a, b) for (ll i = a, _b = b; i >= _b; --i)
#define all(x) x.begin(), x.end()
#define uni(x) sort(all(x)), x.erase(unique(all(x)), x.end())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__)
template<typename T>
void __prine_one(const char *&s, const T &x)
{
while (*s == ' ') ++s;
const char *p = s;
int bal = 0;
while (*s)
{
if (*s == '(') ++bal;
else if (*s == ')') --bal;
else if (*s == ',' && bal == 0) break;
++s;
}
cerr.write(p, s - p) << " = " << x;
if (*s == ',')
{
cerr << " , ";
++s;
}
}
template<typename... Args>
void debug(const char *s, Args... args)
{
cerr << "[ ";
int dummy[] = {0, (__prine_one(s, args), 0)...};
(void)dummy;
cerr << " ]\n\n";
}
template<class X>
bool maximize(X &a, const X &b)
{
if (b > a)
{
a = b;
return true;
}
return false;
}
template<class X>
bool minimize(X &a, const X &b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
// --------------------------------------------------------------------------------------------
constexpr int maxn = 2e5 + 3;
int n, m, q, F[maxn];
pii Eds[maxn];
// --------------------------------------------------------------------------------------------
struct DSU
{
vector<int> e;
vector<pair<int &, int>> history;
vector<int> parity;
int cur_res;
void init(int n)
{
e.assign(n + 3, -1);
parity.assign(n + 3, 0);
cur_res = 0;
}
int get(int u) {return e[u] < 0 ? u : get(e[u]);}
int get_parity(int u)
{
int cur = parity[u];
while (e[u] > 0)
{
u = e[u];
cur ^= parity[u];
}
return cur;
}
bool unite(int u, int v)
{
if (get(u) == get(v))
{
if (cur_res == 0 && get_parity(u) == get_parity(v))
{
history.push_back({cur_res, cur_res});
cur_res = 1;
}
return false;
}
if (e[get(u)] > e[get(v)]) swap(u, v);
if (get_parity(u) == get_parity(v))
{
history.push_back({parity[get(v)], parity[get(v)]});
parity[get(v)] ^= 1;
}
// dbg(u, v, get_parity(u), get_parity(v));
u = get(u);
v = get(v);
history.push_back({e[u], e[u]});
history.push_back({e[v], e[v]});
e[u] += e[v];
e[v] = u;
return true;
}
int snap() {return SZ(history);}
void rollback(int snapshot)
{
while (SZ(history) > snapshot)
{
history.back().fi = history.back().se;
history.pop_back();
}
}
} dsu;
void readInput()
{
cin >> n >> m >> q;
FOR(i, 1, m)
{
int u, v; cin >> u >> v;
if (u > v) swap(u, v);
Eds[i] = {u, v};
}
}
bool connect(int id)
{
if (id < 1 || id > m) return false;
return dsu.unite(Eds[id].fi, Eds[id].se);
}
void DNC(int l, int r, int optl, int optr)
{
if (l > r) return;
int cur_version = dsu.snap();
int mid = l + r >> 1;
// dbg(mid);
FOR(i, l, mid - 1)
{
connect(i);
}
// {
// int bruh = 2;
// while (dsu.e[bruh] > 0)
// {
// bruh = dsu.e[bruh];
// dbg(bruh);
// }
// FOR(j, 1, 6)
// dbg(j, dsu.get_parity(j));
// }
// cerr << endl;
int mid_version = dsu.snap();
FORD(i, optr, max(optl, mid))
{
connect(i);
if (dsu.cur_res)
{
F[mid] = i;
break;
}
}
// dbg(l, r, optl, optr, mid, F[mid]);
if (F[mid])
{
dsu.rollback(mid_version);
connect(mid);
// FOR(j, 1, 6)
// dbg(j, dsu.get_parity(j));
DNC(mid + 1, r, F[mid], optr);
dsu.rollback(cur_version);
FORD(i, optr, F[mid] + 1)
connect(i);
DNC(l, mid - 1, optl, F[mid]);
}
dsu.rollback(cur_version);
}
void solve()
{
dsu.init(n);
FOR(i, 1, m)
F[i] = 0;
DNC(1, m, 1, m + 1);
// FOR(i, 1, m)
// dbg(i, F[i]);
while (q--)
{
int l, r; cin >> l >> r;
if (F[l] > r)
cout << "YES\n";
else
cout << "NO\n";
}
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define TASK "TEST"
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
freopen(TASK".OUT", "w", stdout);
}
readInput();
solve();
return 0;
}
