// #pragma GCC optimize("Ofast", "inline", "fast-math")

#include <cstring>
#include <iostream>
#include <unordered_map>
#include <cassert>
#include <cstdio>
#include <limits>
#include <random>
#include <ctime>
using namespace std;

using uint = unsigned;
using ull = unsigned long long;

mt19937 rnd(101108);

const int N = 1000010;

int n, m, q;
unordered_map<ull, int> cnt;

inline ull O(ull x) {
	x ^= 45151, x ^= x >> 2, x ^= x << 4;
	return x * x + (651 ^ x) + x * x * 13132;
}

inline ull K(ull x) {
	x *= 51564, x ^= 31561, x ^= O(x) << 3;
	return (x ^ 5614561) + x * x * O(x) * 131 + O(x * 465415);
}

inline ull G(ull x) {
	x ^= x >> 2, x ^= x << 4, x *= 515654;
	return x * x * x * 156 + (x ^ 5645) * 651 + K(K(x * x)) * K(x ^ 1361) + K(x >> 4 << 14 | 1151);
}

inline ull F(ull x) {
	x *= 1315615ll, x ^= 545451356, x ^= x << 2;
	return G(x * 321) * 315615 + G(G(G(x * x + 6541))) * 56141;
}

ull w[N], a[N], b[N];
int va[N][3], vb[N][3], R[N], ans;

inline void add(ull x) { cnt[x]++ && --ans, cnt[x] && ++ans; }
inline void del(ull x) { cnt[x]-- && --ans, cnt[x] && ++ans; }
inline void upd(int p, int f) {
	del(a[va[p][0]]), del(a[va[p][1]]), del(a[va[p][2]]);
	if (f == 1) a[va[p][0]] += w[p], a[va[p][1]] += w[p], a[va[p][2]] += w[p];
	else a[va[p][0]] -= w[p], a[va[p][1]] -= w[p], a[va[p][2]] -= w[p];
	add(a[va[p][0]]), add(a[va[p][1]]), add(a[va[p][2]]);
	
	add(b[vb[p][0]]), add(b[vb[p][1]]), add(b[vb[p][2]]);
	if (f == 1) b[vb[p][0]] += w[p], b[vb[p][1]] += w[p], b[vb[p][2]] += w[p];
	else b[vb[p][0]] -= w[p], b[vb[p][1]] -= w[p], b[vb[p][2]] -= w[p];
	del(b[vb[p][0]]), del(b[vb[p][1]]), del(b[vb[p][2]]);
}

signed main() {
    scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= n; ++i) scanf("%d%d%d", &va[i][0], &va[i][1], &va[i][2]);
	for (int i = 1; i <= n; ++i) scanf("%d%d%d", &vb[i][0], &vb[i][1], &vb[i][2]);
	for (int i = 1; i <= n; ++i) w[i] = F(1ull * i * n * m * q);
	for (int i = 1, j = 0; i <= n; R[i] = j, upd(i++, -1)) while (j <= n && !ans) upd(++j, 1);
	for (int l, r; q--; scanf("%d%d", &l, &r), puts(R[l] > r ? "Yes" : "No"));
    return 0;
}