#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef array<int, 3> arr;
const ll mod = 1e9 + 7;
// cope counter = 2254

ll rng() {
	static ll x = 123456789, y = 362436069, z = 521288629;
	ll t;
	x ^= x << 16, x ^= x >> 5, x ^= x << 1;
	t = x, x = y, y = z, z = t ^ x ^ y;
	return x ^ y ^ z;
}

const int N = 2e5 + 1;
arr a[N], b[N];
ll bk[N], ans[N], fa[3 * N], fb[3 * N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	for(int i = 0; i < n; i++) for(int j = 0; j < 3; j++) cin >> a[i][j];
	for(int i = 0; i < n; i++) for(int j = 0; j < 3; j++) cin >> b[i][j];
	for(int i = 0; i < n; i++) bk[i] = rng() % mod;
	for(int i = 0; i <= 3 * n; i++) fa[i] = fb[i] = 0;
	int j = 0, l, r;
	int aa[3], bb[3];
	for(int i = 0; i < n; i++) {
		while(j < n) {
			for(int k = 0; k < 3; k++) aa[k] = fa[a[j][k]], bb[k] = fb[b[j][k]];
			sort(aa, aa + 3), sort(bb, bb + 3);
			if(aa[0] != bb[0] || aa[1] != bb[1] || aa[2] != bb[2]) break;
			for(int k = 0; k < 3; k++) fa[a[j][k]] ^= bk[j], fb[b[j][k]] ^= bk[j];
			j++;
		}
		ans[i] = j;
		for(int &k : a[i]) fa[k] ^= bk[i];
		for(int &k : b[i]) fb[k] ^= bk[i];
	}
	for(int i = 0; i < q; i++) {
		cin >> l >> r;
		cout << (ans[l - 1] >= r ? "Yes\n" : "No\n");
	}
}