#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ll;

mt19937_64 rng(time(NULL));

const int N = 2e5 + 5;
const int M = 6e5 + 5;

int n, m, q, cnt, a[N][3], b[N][3], ans[N];

ll w[N], hsh1[M], hsh2[M];

unordered_map <ll, int> mp;

inline void Add(ll pos, int val) {
	if (mp[pos] == 0) {
		++cnt;
	}
	mp[pos] += val;
	if (mp[pos] == 0) {
		--cnt;
	}
}

inline void add(int i, ll val) {
	Add(hsh1[a[i][0]], -1);
	Add(hsh1[a[i][1]], -1);
	Add(hsh1[a[i][2]], -1);
	hsh1[a[i][0]] += val;
	hsh1[a[i][1]] += val;
	hsh1[a[i][2]] += val;
	Add(hsh1[a[i][0]], 1);
	Add(hsh1[a[i][1]], 1);
	Add(hsh1[a[i][2]], 1);
	Add(hsh2[b[i][0]], 1);
	Add(hsh2[b[i][1]], 1);
	Add(hsh2[b[i][2]], 1);
	hsh2[b[i][0]] += val;
	hsh2[b[i][1]] += val;
	hsh2[b[i][2]] += val;
	Add(hsh2[b[i][0]], -1);
	Add(hsh2[b[i][1]], -1);
	Add(hsh2[b[i][2]], -1);
}

int main() {
//	assert(freopen("set.in", "r", stdin));
//	assert(freopen("set.out", "w", stdout));
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> m >> q;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i][0] >> a[i][1] >> a[i][2];
	}
	for (int i = 1; i <= n; ++i) {
		cin >> b[i][0] >> b[i][1] >> b[i][2];
	}
	for (int i = 1; i <= n; ++i) {
		w[i] = rng();
	}
	for (int i = 1; i <= n; ++i) {
		if (i > 1) {
			add(i - 1, -w[i - 1]);
		}
		ans[i] = ans[i - 1];
		if (ans[i] < i) {
			ans[i] = i;
			add(i, w[i]);
		}
		while (ans[i] < n) {
			add(ans[i] + 1, w[ans[i] + 1]);
			if (cnt != 0) {
				add(ans[i] + 1, -w[ans[i] + 1]);
				break;
			}
			++ans[i];
		}
	}
	while (q--) {
		int l, r;
		cin >> l >> r;
		if (ans[l] >= r) {
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
	}
	return 0;
}