#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5,mod1=998244353,mod2=1e9+7;
mt19937 rnd(time(0));
long long n,m,q,a[3*N],b[3*N],val1[N],val2[N],cnta1[3*N],cntb1[3*N],cnta2[3*N],cntb2[3*N],L[5*N],R[5*N],maxx[3*N];
long long sum1,sum2;
void add(int x,int y)
{
	for(int i=0;i<3;i++)
	{
		int tmp1=a[3*x-i],tmp2=b[3*x-i];
		sum1-=1ll*cnta1[tmp1]*cnta1[tmp1]%mod1*cnta1[tmp1]%mod1;
		cnta1[tmp1]=(cnta1[tmp1]+mod1+y*val1[x])%mod1;
		sum1+=1ll*cnta1[tmp1]*cnta1[tmp1]%mod1*cnta1[tmp1]%mod1;
		sum2-=1ll*cnta2[tmp1]*cnta2[tmp1]%mod2*cnta2[tmp1]%mod2;
		cnta2[tmp1]=(cnta2[tmp1]+mod2+y*val2[x])%mod2;
		sum2+=1ll*cnta2[tmp1]*cnta2[tmp1]%mod2*cnta2[tmp1]%mod2;
		sum1+=1ll*cntb1[tmp2]*cntb1[tmp2]%mod1*cntb1[tmp2]%mod1;
		cntb1[tmp2]=(cntb1[tmp2]+mod1+y*val1[x])%mod1;
		sum1-=1ll*cntb1[tmp2]*cntb1[tmp2]%mod1*cntb1[tmp2]%mod1;
		sum2+=1ll*cntb2[tmp2]*cntb2[tmp2]%mod2*cntb2[tmp2]%mod2;
		cntb2[tmp2]=(cntb2[tmp2]+mod2+y*val2[x])%mod2;
		sum2-=1ll*cntb2[tmp2]*cntb2[tmp2]%mod2*cntb2[tmp2]%mod2;
	}
}
bool check(int x)
{
	add(x,1);
	bool flag=!sum1&&!sum2;
	add(x,-1);
	return flag;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	for(int i=1;i<=3*n;i++)cin>>a[i];
	for(int i=1;i<=3*n;i++)cin>>b[i];
	for(int i=1;i<=q;i++)cin>>L[i]>>R[i];
	for(int i=1;i<=n;i++)val1[i]=rnd()%mod1+1,val2[i]=rnd()%mod2+1;
	int r=1;
	for(int i=1;i<=n;i++)
	{
		while(r<=n&&check(r))add(r,1),r++;
		maxx[i]=r-1,add(i,-1);
		if(r==i)r++;
	}
	for(int i=1;i<=q;i++)
	{
		if(R[i]<=maxx[L[i]])cout<<"Yes\n";
		else cout<<"No\n";
	}
	return 0;
}