#include <bits/stdc++.h>
namespace // my guiding star
{
#define filein(x) freopen(x".in", "r", stdin);
#define fileout(x) freopen(x, "w", stdout);
#define fileerr(x) freopen(x, "w", stderr);
#define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);
#define files(x) freopen(x".in", "r", stdin), freopen(x".ans", "w", stdout);
using namespace std;
#define cT const T&
template<typename T>
inline T chkmin(T& x, cT y){if (x > y) x = y; return x;}
template<typename T>
inline T chkmax(T& x, cT y){if (x < y) x = y; return x;}
template <typename T>
inline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}
#undef cT
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef unsigned u32;
template <typename T>
using pr = pair<T, T>;
typedef pr<int> pii;
typedef pr<ll> pll;
typedef pr<db> pdd; 
typedef complex<double> cp;
typedef vector<int> vi;
inline void YN(bool x){puts(x ? "Yes" : "No");}
}
const int N = 2e5 + 233;
int n, m, q, a[N][3], b[N][3], ans[N];
mt19937_64 rnd(1);
ull xorshift(ull x){x ^= 1 << 13; x ^= x >> 7; x ^= x << 17; return x;}
ull hshA, hshB, val[N], valA[N * 3], valB[N * 3];
int main()
{
	scanf("%d%d%d", &n, &m, &q);
	for (int i=1; i<=n; i++) scanf("%d%d%d", a[i], a[i]+1, a[i]+2);
	for (int i=1; i<=n; i++) scanf("%d%d%d", b[i], b[i]+1, b[i]+2);
	for (int i=1; i<=n; i++) val[i] = rnd();
	auto insert = [&](int p, int op)
	{
		for (int i=0; i<3; i++)
		{
			int x = a[p][i];
			hshA -= xorshift(valA[x]); valA[x] += val[p] * op; hshA += xorshift(valA[x]);
			x = b[p][i];
			hshB -= xorshift(valB[x]); valB[x] += val[p] * op; hshB += xorshift(valB[x]);
		}
	};
	for (int i=n, j=n; i>=1; i--)
	{
		insert(i, 1);
		while (hshA != hshB) insert(j--, -1);
		ans[i] = j;
	}
	int l, r;
	while (q--){scanf("%d%d", &l, &r); YN(ans[l] >= r);}
	return 0;
}