#include <bits/stdc++.h>
#define DIMN 400010
using namespace std;
int tt[DIMN];
int sz[DIMN] , opt[DIMN];
int n , m , where;
pair <int , int> mch[DIMN];
vector <int> s;
vector <int> v;
int root (int x){
while (tt[x] != x)
x = tt[x];
return x;
}
inline void unite (int x, int y){
int radx = root(x), rady = root(y);
if (radx == rady)
return;
if (sz[radx] < sz[rady])
swap (radx,rady);
s.push_back(rady); /// stiva pt undo
sz[radx] += sz[rady];
tt[rady] = radx;
}
inline int unite_init (int x , int y){
int radx = root(x) , radnx , rady = root(y) , radny;
if (radx == rady)
return 0;
radnx = root(n + x);
radny = root(n + y);
unite(radx , radny);
unite(rady , radnx);
return 1;
}
void solve(int st, int dr, int l, int r) {
int mid = (st + dr)/2 , i , poz , x , y , init , init2;
if (mid <= where){
if (mid + 1 <= dr)
solve(mid + 1 , dr , l , r);
return;
}
init = s.size();
for (i = min(dr , m) ; i >= mid ; i--){
x = mch[i].first;
y = mch[i].second;
if (!unite_init(x , y))
break;
}
if (i >= mid){ /// nu se poate cu toate
where = i;
while (s.size() != init){
y = s.back();
s.pop_back();
sz[tt[y]] -= sz[y];
tt[y] = y;
}
/// te duci doar in dreapta
if (mid + 1 <= dr)
solve(mid + 1 , dr , l , r);
return;
}
init2 = s.size();
poz = l;
for (i = l + 1 ; i <= r && i < mid ; i++){
x = mch[i].first;
y = mch[i].second;
if (!unite_init(x , y))
break;
poz = i;
}
opt[mid] = poz;
while (s.size() != init2){
y = s.back();
s.pop_back();
sz[tt[y]] -= sz[y];
tt[y] = y;
}
if (st <= mid - 1)
solve (st , mid - 1 , l , poz);
while (s.size() != init){
y = s.back();
s.pop_back();
sz[tt[y]] -= sz[y];
tt[y] = y;
}
if (mid + 1 <= dr){
for (i = l + 1 ; i <= poz ; i++){
x = mch[i].first;
y = mch[i].second;
unite_init (x , y);
//v.push_back(i);
}
solve(mid + 1 , dr , poz , r);
while (s.size() != init){
y = s.back();
s.pop_back();
sz[tt[y]] -= sz[y];
tt[y] = y;
}
}
}
int main() {
FILE *fin = stdin;
FILE *fout = stdout;
int q , i , l , r;
fscanf (fin,"%d%d%d",&n,&m,&q);
for (i = 1; i <= m; ++i) {
fscanf (fin,"%d%d",&mch[i].first,&mch[i].second);
}
for (i = 1; i <= 2 * n ; ++i){
tt[i] = i;
sz[i] = 1;
}
solve(1, m + 1 , 0 , m);
for (;q;q--) {
fscanf (fin,"%d%d",&l,&r);
if (opt[r + 1] >= l - 1 && r + 1 > where)
fprintf (fout,"NO\n");
else fprintf (fout,"YES\n");
}
return 0;
}
