/*
  author: honglan0301
  Sexy_goodier _ xiaoqing
 */
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cctype>
#include <queue>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <cmath>
#include <set>
#include <bitset>
#include <assert.h>
using namespace std;

//namespace Fread{const int SIZE=1<<20;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return*S++;}}using namespace Fread;namespace Fwrite{const int SIZE=1<<20;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}using namespace Fwrite;
//#define getchar Fread::getchar
//#define putchar Fwrite::putchar

namespace Fastio{struct Reader{template<typename T>Reader&operator>>(T&x){x=0;short f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();x*=f;return*this;}Reader&operator>>(double&x){x=0;double t=0;short f=1,s=0;char c=getchar();while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else{x*=f;return*this;}while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}Reader&operator>>(long double&x){x=0;long double t=0;short f=1,s=0;char c=getchar();while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else{x*=f;return*this;}while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}Reader&operator>>(__float128&x){x=0;__float128 t=0;short f=1,s=0;char c=getchar();while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else{x*=f;return*this;}while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}Reader&operator>>(char&c){c=getchar();while(c==' '||c=='\n'||c=='\r')c=getchar();return*this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c==' '||c=='\n'||c=='\r')c=getchar();while(c!=' '&&c!='\n'&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}Reader&operator>>(string&str){str.clear();char c=getchar();while(c==' '||c=='\n'||c=='\r')c=getchar();while(c!=' '&&c!='\n'&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';struct Writer{const int Setprecision=6;typedef int mxdouble;template<typename T>Writer&operator<<(T x){if(x==0){putchar('0');return*this;}if(x<0)putchar('-'),x=-x;static short sta[40];short top=0;while(x>0)sta[++top]=x%10,x/=10;while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(double x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(double)_;static short sta[40];short top=0;while(_>0)sta[++top]=_%10,_/=10;if(top==0)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_>0)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(long double x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(long double)_;static short sta[40];short top=0;while(_>0)sta[++top]=_%10,_/=10;if(top==0)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_>0)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(__float128 x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(__float128)_;static short sta[40];short top=0;while(_>0)sta[++top]=_%10,_/=10;if(top==0)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x;while(_>0)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top>0)putchar(sta[top]+'0'),top--;return*this;}Writer&operator<<(char c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(string str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}using namespace Fastio;
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl//;fflush(stdout)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 998244353

int n,m,q,u[400005],v[400005],nl[200005],nr[200005],tl[200005],nmd[200005],nans,ans[200005];
int nmn[400005],nmx[400005];

vector <int> cz[600005];
void add(int l,int r,int x,int y,int k,int p)
{
	if(l>=x&&r<=y) return cz[p].pb(k),void(); int mid=(l+r)>>1;
	if(mid>=x) add(l,mid,x,y,k,p<<1); if(mid<y) add(mid+1,r,x,y,k,(p<<1)|1);
}

int fa[400005],sz[400005],top,mxp;
int getfa(int x) {while(fa[x]!=x) x=fa[x]; return x;}
pair <int,int> stk[8000005];

void merge(int x,int y)
{
	x=getfa(x),y=getfa(y); if(x==y) return; if(sz[x]>sz[y]) swap(x,y);
	stk[++top]=mp(x,sz[x]); sz[y]+=sz[x]; fa[x]=y;
}

void solve(int l,int r,int p)
{
	int lst=nans,ntp=top;
	if(!lst)
	{
		for(auto i:cz[p])
		{
			merge(u[i],v[i]+n); merge(u[i]+n,v[i]);
			if(getfa(u[i])==getfa(u[i]+n)||getfa(v[i]==getfa(v[i]+n))) {nans=1; break;}
		}
	}
	if(l==r) ans[l]=nans; else solve(l,(l+r)>>1,p<<1),solve(((l+r)>>1)+1,r,(p<<1)|1);
	while(top>ntp) sz[fa[stk[top].fi]]-=stk[top].se,fa[stk[top].fi]=stk[top].fi,top--;
	nans=lst; cz[p].clear();
}

int cnt[200005],ncc,nx[200005],ny[200005],bh[200005],mxm,mnm;

bool ck()
{
	int na=0;
	for(int i=1;i<=2*n;i++) fa[i]=i,sz[i]=1;
	for(int i=1;i<=m;i++) 
	{
		merge(u[i],v[i]+n),merge(u[i]+n,v[i]);
		if(getfa(u[i])==getfa(u[i]+n)||getfa(v[i])==getfa(v[i]+n))
		{
			mnm=i; mxm=i+m; na=1; break;
		}
	}
	return na;
}

signed main()
{
	//freopen("joker.i060","r",stdin);
	cin>>n>>m>>q; for(int i=1;i<=m;i++) cin>>u[i]>>v[i],u[i+m]=u[i],v[i+m]=v[i];
	if(!ck()) {for(int i=1;i<=q;i++) cout<<"NO"<<endl; return 0;}
	for(int i=1;i<=q;i++) cin>>nx[i]>>ny[i],cnt[ny[i]%m+1]++;
	for(int i=1;i<=m;i++) 
	{
		if(cnt[i]) ncc++,nl[ncc]=mnm,nr[ncc]=mxm,tl[ncc]=i,bh[i]=ncc;
	}
	tl[ncc+1]=m+m;
	while(1)
	{
		bool flag=1;
		for(int i=1;i<=ncc;i++) nmd[i]=((nl[i]+nr[i])>>1);
		for(int i=1;i<=ncc;i++) flag&=(nl[i]>nr[i]); if(flag) break;
		memset(nmn,127,sizeof(nmn)); memset(nmx,0,sizeof(nmx));
		for(int i=1;i<=ncc;i++) for(int j=nmd[i-1]+1;j<=nmd[i];j++) nmn[j]=i;
		for(int i=1;i<=ncc;i++) for(int j=tl[i];j<=tl[i+1]&&j<=nmd[i];j++) nmx[j]=i;
		for(int i=1;i<=2*m;i++) if(nmx[i]>=nmn[i]) add(1,ncc,nmn[i],nmx[i],i,1);
		nans=top=0; for(int i=1;i<=2*n;i++) sz[i]=1,fa[i]=i; solve(1,ncc,1);
		for(int i=1;i<=ncc;i++) if(ans[i]) nr[i]=nmd[i]-1; else nl[i]=nmd[i]+1;
	}
	for(int i=1;i<=q;i++)
	{
		if(ny[i]==m) {cout<<((nl[bh[1]]<nx[i])?"YES":"NO")<<endl;}
		else {cout<<((nl[bh[ny[i]+1]]<nx[i]+m)?"YES":"NO")<<endl;}
	}
}