#include<bits/stdc++.h>
using namespace std;
#define u64 unsigned long long

const int N = 2e5 + 10, M = 3 * N, P = 13331;
int n, m, q, a[N][3], b[N][3];
u64 p[N], h1[M], h2[M];
int f[N];

int main()
{
	cin >> n >> m >> q;
	for(int i = 1; i <= n; i++) scanf("%d%d%d", &a[i][0], &a[i][1], &a[i][2]);
	for(int i = 1; i <= n; i++) scanf("%d%d%d", &b[i][0], &b[i][1], &b[i][2]);
	p[0] = 1;
	for(int i = 1; i <= n; i++) p[i] = p[i - 1] * P;
	
	for(int i = 1, j = 1; i <= n; i++)
	{
		auto check = [&](u64 a1, u64 a2, u64 a3, u64 b1, u64 b2, u64 b3)
		{
			return max({a1,a2,a3}) == max({b1,b2,b3}) && min({a1,a2,a3}) == min({b1,b2,b3}) && a1+a2+a3 == b1+b2+b3;
		};
		
		while(j <= n && check(h1[a[j][0]], h1[a[j][1]], h1[a[j][2]], h2[b[j][0]], h2[b[j][1]], h2[b[j][2]]))
			h1[a[j][0]] += p[j], h1[a[j][1]] += p[j], h1[a[j][2]] += p[j], h2[b[j][0]] += p[j], h2[b[j][1]] += p[j], h2[b[j][2]] += p[j], j++;
		f[i] = j - 1;
		h1[a[i][0]] -= p[i], h1[a[i][1]] -= p[i], h1[a[i][2]] -= p[i], h2[b[i][0]] -= p[i], h2[b[i][1]] -= p[i], h2[b[i][2]] -= p[i];
	}
	
	while(q--)
	{
		int l, r;
		scanf("%d%d", &l, &r);
		puts(f[l] >= r ? "Yes" : "No");
	}
	return 0;
}