// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
const int INF = 1e9 , mod = 1e9 + 7;
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
#define PROB "a"
void file(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp","r",stdin);
freopen(PROB".out","w",stdout);
}
}
void sinh_(){
// srand(time(0));
// freopen(PROB".inp" , "w" , stdout);
// int n;
}
typedef long long ll;
typedef double db;
const int N = 2e5 + 5;
const int B = 4500;
int n, m, q;
int ans[N];
pii edge[N];
int par[N], sz[N], f[N];
bool oke = 0;
struct Data{
int u, su;
int v, sv;
Data(int _u = 0, int _su = 0, int _v = 0, int _sv = 0) {
u = _u, su = _su, v = _v, sv = _sv;
}
};
pii root(int x) {
int u = x, w = 0;
while(u != par[u]) {
w ^= f[u];
u = par[u];
}
return {u, w};
}
void unite(int ru, int rv, int w) {
if (sz[ru] < sz[rv]) swap(ru, rv);
par[rv] = ru;
sz[ru] += sz[rv];
f[rv] = w;
}
struct Query{
int l, r;
Query(int _l = 0, int _r = 0) {
l = _l, r = _r;
}
} Query[N];
void readip(){
cin >> n >> m >> q;
REP(i, 1, m) cin >> edge[i].first >> edge[i].second;
REP(i, 1, q) cin >> Query[i].l >> Query[i].r;
}
void init() {
REP(i, 1, n) {
par[i] = i;
sz[i] = 1;
f[i] = 0;
}
oke = 0;
}
void dnc(int l, int r, int MinAns, int MaxAns) {
int mid = (l + r) >> 1;
ans[mid] = MaxAns;
vector<Data> st1, st2;
bool rem_oke1 = oke;
REPD(i, r, mid) {
int u = edge[i].fi, v = edge[i].se;
const auto &[ru, wu] = root(u);
const auto &[rv, wv] = root(v);
if (ru == rv) {
oke |= (wu == wv);
}
else {
st1.eb(ru, sz[ru], rv, sz[rv]);
unite(ru, rv, wu ^ wv ^ 1);
}
}
bool rem_oke2 = oke;
if (oke) ans[mid] = MinAns;
else {
for (int i = MinAns + 1; i < mid && i <= MaxAns; ++i) {
int u = edge[i].fi, v = edge[i].se;
const auto &[ru, wu] = root(u);
const auto &[rv, wv] = root(v);
if (ru == rv) {
oke |= (wu == wv);
if (oke) {
ans[mid] = i;
break;
}
}
else {
st2.eb(ru, sz[ru], rv, sz[rv]);
unite(ru, rv, wu ^ wv ^ 1);
}
}
}
oke = rem_oke2;
while(!st2.empty()) {
const auto &[u, su, v, sv] = st2.back(); st2.pop_back();
par[u] = u, sz[u] = su, f[u] = 0;
par[v] = v, sz[v] = sv, f[v] = 0;
}
if (l < mid) dnc(l, mid - 1, MinAns, ans[mid]);
oke = rem_oke1;
while(!st1.empty()) {
const auto &[u, su, v, sv] = st1.back(); st1.pop_back();
par[u] = u, sz[u] = su, f[u] = 0;
par[v] = v, sz[v] = sv, f[v] = 0;
}
rem_oke1 = oke;
REP(i, MinAns + 1, ans[mid]) {
int u = edge[i].fi, v = edge[i].se;
const auto &[ru, wu] = root(u);
const auto &[rv, wv] = root(v);
if (ru == rv) {
oke |= (wu == wv);
}
else {
st1.eb(ru, sz[ru], rv, sz[rv]);
unite(ru, rv, wu ^ wv ^ 1);
}
}
if (mid < r) dnc(mid + 1, r, ans[mid], MaxAns);
oke = rem_oke1;
while(!st1.empty()) {
const auto &[u, su, v, sv] = st1.back(); st1.pop_back();
par[u] = u, sz[u] = su, f[u] = 0;
par[v] = v, sz[v] = sv, f[v] = 0;
}
}
void solve() {
init();
dnc(1, m, 0, m);
init();
ans[m + 1] = m + 1;
REP(i, 1, m) {
int u = edge[i].fi, v = edge[i].se;
const auto &[ru, wu] = root(u);
const auto &[rv, wv] = root(v);
if (ru == rv) {
oke |= (wu == wv);
if (oke) {
ans[m + 1] = i;
break;
}
}
else unite(ru, rv, wu ^ wv ^ 1);
}
REP(i, 1, q) {
if (ans[Query[i].r + 1] < Query[i].l)
cout << "YES" << ln;
else
cout << "NO" << ln;
}
}
int main(){
sinh_();
io_faster
file();
int t = 1;
// cin >> t;
while (t--){
readip();
solve();
}
}
