#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#define ll long long
#define _1 first
#define _2 second
#define _mp make_pair
#define _pb push_back
#define MAX_M 522222

using namespace std;

ll read(){ll x = 0;char c = 0, v = 0;do{c = getchar();if(c == '-')v = 1;} while(c < '0' || c > '9');do{x = (x << 3) + (x << 1) + c - '0';c = getchar();} while(c >= '0' && c <= '9');return v ? -x : x;}

template<size_t N>
struct vset
{
    struct node
    {
        int id;
        int x, y;
        int fx, fy;
        bool dx, dy;
    } clr[N];

    int tot;

    int f[N];
    bool d[N];
    vset() { memset(f, 255, sizeof(f)), memset(d, 0, sizeof(d)); }
    int fath(int x) { return f[x] < 0 ? x : fath(f[x]); }
    bool col(int x)
    {
        bool cl = 0;
        for(int i = x; i >= 0; i = f[i])
            cl ^= d[i];
        return cl;
    }

    bool check(int x, int y) { return fath(x) != fath(y) || col(x) != col(y); }

    void merge(int x, int y, int id)
    {
    	//return;
    	//printf("%d %d %d\n", x, y, id);
        bool cx = col(x), cy = col(y);
        x = fath(x), y = fath(y);
        //return;
        clr[++tot] = (node){id, x, y, f[x], f[y], d[x], d[y]};
    	//return;
        if(x == y)
            return;
        if(f[x] > f[y])
            swap(x, y);
        if(cx == cy)
            d[y] ^= 1;
        f[x] += f[y];
        f[y] = x;
    }

    inline int topid() { return clr[tot].id; }

    void del()
    {
        int x = clr[tot].x, y = clr[tot].y;
        f[x] = clr[tot].fx, f[y] = clr[tot].fy;
        d[x] = clr[tot].dx, d[y] = clr[tot].dy;
        tot--;
    }
};

vset<MAX_M> st;

struct node { int u, v; };

int n, m, q;
node a[MAX_M];
int ans[MAX_M];

void dfs(int ql, int qr, int l, int r)
{
    //printf("%d %d %d %d\n", ql, qr, l, r);
    if(l == r)
    {
        for(int i = ql; i <= qr; i++)
            ans[i] = l;
        return;
    }
    int mid = (l + r) >> 1;
    for(int i = r; i >= mid; i--)
    {
        if(!st.check(a[i].u, a[i].v))
        {
            while(st.topid() <= r && st.topid() >= mid)
                st.del();
            dfs(ql, qr, mid + 1, r);
            return;
        }
        st.merge(a[i].u, a[i].v, i);
    }
    //return;
    for(int i = ql; i <= qr; i++)
    {
    	//return;
        if(!st.check(a[i].u, a[i].v))
        {
        	//return;
            while(st.topid() <= r && st.topid() >= mid)
                st.del();
            dfs(i, qr, mid + 1, r);
            while(st.topid() < i && st.topid() >= ql)
                st.del();
            for(int j = r; j > mid; j--)
                st.merge(a[j].u, a[j].v, j);
            dfs(ql, i - 1, l, mid);
            return;
        }
        st.merge(a[i].u, a[i].v, i);
    }
    while(st.topid() >= ql && st.topid() <= r)
        st.del();
    for(int j = r; j > mid; j--)
        st.merge(a[j].u, a[j].v, j);
    dfs(ql, qr, l, mid);
}

void MAIN()
{
    n = read();
    m = read();
    q = read();
    for(int i = 1; i <= m; i++)
        a[i].u = read(), a[i].v = read();
    dfs(1, m, 1, m);
    /*for(int i = 1; i <= m; i++)
    	printf("%d ", ans[i]);*/
    for(int i = 1; i <= q; i++)
    {
        int l = read();
        int r = read();
        if(r >= ans[l])
            printf("NO\n");
        else
            printf("YES\n");
    }
}

void CLEAR()
{
    ;
}

void EXP()
{
    ;
}

int main()
{
    EXP();
    int T = 1;
    while(T--)
        MAIN(), CLEAR();
    return 0;
}