#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
mt19937_64 eng(363415);
int n, m, q;
unordered_map<ll, int> f;
int g;
void UpdCnt(ll p, int x) {
	if (f[p]) g--;
	f[p] += x;
	if (f[p]) g++;
}
int a[600005], b[600005];
ull fa[600005], fb[600005], w[600005];
void Upd(int p, int x) {
	UpdCnt(fa[a[p * 3 - 2]], -1), UpdCnt(fa[a[p * 3 - 1]], -1), UpdCnt(fa[a[p * 3]], -1);
	fa[a[p * 3 - 2]] += w[p] * x;
	fa[a[p * 3 - 1]] += w[p] * x;
	fa[a[p * 3]] += w[p] * x;
	UpdCnt(fa[a[p * 3 - 2]], 1), UpdCnt(fa[a[p * 3 - 1]], 1), UpdCnt(fa[a[p * 3]], 1);
	UpdCnt(fb[b[p * 3 - 2]], 1), UpdCnt(fb[b[p * 3 - 1]], 1), UpdCnt(fb[b[p * 3]], 1);
	fb[b[p * 3 - 2]] += w[p] * x;
	fb[b[p * 3 - 1]] += w[p] * x;
	fb[b[p * 3]] += w[p] * x;
	UpdCnt(fb[b[p * 3 - 2]], -1), UpdCnt(fb[b[p * 3 - 1]], -1), UpdCnt(fb[b[p * 3]], -1);
}
int ans[600005];
int main() {
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= n; i++) w[i] = eng();
	for (int i = 1; i <= n * 3; i++) scanf("%d", a + i);
	for (int i = 1; i <= n * 3; i++) scanf("%d", b + i);
	for (int r = 1, l = 1; r <= n; r++) {
		Upd(r, 1);
		while (g) Upd(l++, -1);
		ans[r] = l;
	}
	while (q--) {
		int l, r; scanf("%d%d", &l, &r);
		puts(l >= ans[r] ? "Yes" : "No");
	}
	return 0;
}