#include <bits/stdc++.h>
#define N 600011
#define ull unsigned long long
#define pii pair<int,int>
#define s1 first
#define s2 second
using namespace std;
int a[N],b[N],n,m,q;
mt19937_64 rnd(801);
const int B=1000;
struct kueri
{
	int l,r,lb,id;
};
bool cmp(kueri a,kueri b){return a.lb==b.lb?a.r<b.r:a.lb<b.lb;}
vector<kueri> vk;
ull ha[N],HA,hb[N],HB,V[N];
int ans[1000011],bb[N];
void moda(int x,int i)
{
	HA-=ha[a[x]];
	ha[a[x]]^=V[i];
	HA+=ha[a[x]];
}
void modb(int x,int i)
{
	HB-=hb[b[x]];
	hb[b[x]]^=V[i];
	HB+=hb[b[x]];
}
int f[N];
int main()
{
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=3*n;++i)scanf("%d",a+i);
	for(int i=1;i<=3*n;++i)scanf("%d",b+i);
	for(int i=1;i<=n;++i)V[i]=rnd();
	int L=1;
	for(int i=1;i<=n;++i)
	{
		moda(3*i-2,i);
		moda(3*i-1,i);
		moda(3*i,i);
		modb(3*i-2,i);
		modb(3*i-1,i);
		modb(3*i,i);
		while(HA!=HB)
		{
			moda(3*L-2,L);
			moda(3*L-1,L);
			moda(3*L,L);
			modb(3*L-2,L);
			modb(3*L-1,L);
			modb(3*L,L);
			++L;
		}
		f[i]=L;
	}
	for(int i=1;i<=q;++i)
	{
		int l,r;scanf("%d%d",&l,&r);
		printf(f[r]<=l?"Yes\n":"No\n");
	}
	fclose(stdin);fclose(stdout);return 0;
}