#include <bits/stdc++.h>
#define lowbit(x) (x & (-x))
using namespace std;

const int N = 200010;
int n, m, q, lim[N], a[N][3], b[N][3];

long long va, vb, na[N * 3], nb[N * 3];
inline void update(int pos, int opt)
{
	for(int i = 0; i <= 2; ++i)
	{
		va -= na[a[pos][i]] * na[a[pos][i]] * (long long)sqrtl(na[a[pos][i]]);
		na[a[pos][i]] += opt * 1ll * pos * pos * (long long)sqrtl(pos);
		va += na[a[pos][i]] * na[a[pos][i]] * (long long)sqrtl(na[a[pos][i]]);
		
		vb -= nb[b[pos][i]] * nb[b[pos][i]] * (long long)sqrtl(nb[b[pos][i]]);
		nb[b[pos][i]] += opt * 1ll * pos * pos * (long long)sqrtl(pos);
		vb += nb[b[pos][i]] * nb[b[pos][i]] * (long long)sqrtl(nb[b[pos][i]]);
	}
//	for(int i = 1; i <= 4; ++i) cerr << na[i] << " "; cerr << '\n';
//	for(int i = 1; i <= 4; ++i) cerr << nb[i] << " "; cerr << '\n';
}

int main()
{
//	freopen("text.in", "r", stdin);
//	freopen("prog.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> q;
	for(int i = 1; i <= n; ++i)
		for(int j = 0; j <= 2; ++j)
			cin >> a[i][j];
	for(int i = 1; i <= n; ++i)
		for(int j = 0; j <= 2; ++j)
			cin >> b[i][j];
	int r = 0;
	for(int l = 1; l <= n; ++l)
	{
		while(r < n)
		{
			++r; update(r, 1);
			if(va != vb)
			{
				update(r, -1); --r;
				break;
			}
		}
		lim[l] = r; update(l, -1);
	}
	for(int i = 1; i <= q; ++i)
	{
		int l, r; cin >> l >> r;
		if(r <= lim[l]) cout << "Yes" << '\n';
		else cout << "No" << '\n';
	}
	return 0;
}
/*
1100043
2 2 2 2 3 6 19 183
*/