#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
char Buf[1<<23],*P1=Buf,*P2=Buf;
#define getchar() (P1==P2&&(P2=(P1=Buf)+fread(Buf,1,1<<23,stdin),P1==P2)?EOF:*P1++)
template<typename type>
inline void read(type &x)
{
	x=0;
	bool f=false;
	char ch=getchar();
	while(ch<'0'||ch>'9')
		f|=ch=='-',ch=getchar();
	while(ch>='0'&&ch<='9')
		x=x*10+(ch^48),ch=getchar();
	if(f)
		x=-x;
}
template<typename type,typename... args>
inline void read(type &x,args&... y)
{
	read(x),read(y...);
}
constexpr int Max=2e5+10,Size=Max*3;
mt19937_64 rng(666);
ull num[Max];
int n,m,q;
int a[Max][3],b[Max][3],val[Max];
struct shengqile
{
	ull f[Size],ans;
	inline void add(int x,int y)// a[x] = y
	{
		ans-=f[y]*f[y];
		f[y]^=num[x];
		ans+=f[y]*f[y];
	}
}A,B;
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	read(n,m,q);
	for(int i=1;i<=n;++i)
		num[i]=rng();
	for(int i=1;i<=n;++i)
		read(a[i][0],a[i][1],a[i][2]);
	for(int i=1;i<=n;++i)
		read(b[i][0],b[i][1],b[i][2]);
	for(int i=1,j=0;i<=n;++i)
	{
		val[i]=val[i-1];
		while(A.ans==B.ans)
		{
			val[i]=j;
			if(j==n)
				break;
			++j;
			for(int x:a[j])
				A.add(j,x);
			for(int x:b[j])
				B.add(j,x);
		}
		for(int x:a[i])
			A.add(i,x);
		for(int x:b[i])
			B.add(i,x);
	}
	int l,r;
	while(q--)
	{
		read(l,r);
		if(val[l]>=r)
			cout<<"Yes\n";
		else
			cout<<"No\n";
	}
	return 0;
}