#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int MAXN = 6e5 + 10;

mt19937_64 eng(time(0));

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

ull w[MAXN], ha[MAXN], hb[MAXN]; int a[MAXN][3], b[MAXN][3], p[MAXN];

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 i, int t) {
	del(ha[a[i][0]]), del(ha[a[i][1]]), del(ha[a[i][2]]);
	if (t == 1) ha[a[i][0]] += w[i], ha[a[i][1]] += w[i], ha[a[i][2]] += w[i];
	else ha[a[i][0]] -= w[i], ha[a[i][1]] -= w[i], ha[a[i][2]] -= w[i];
	add(ha[a[i][0]]), add(ha[a[i][1]]), add(ha[a[i][2]]);
	
	add(hb[b[i][0]]), add(hb[b[i][1]]), add(hb[b[i][2]]);
	if (t == 1) hb[b[i][0]] += w[i], hb[b[i][1]] += w[i], hb[b[i][2]] += w[i];
	else hb[b[i][0]] -= w[i], hb[b[i][1]] -= w[i], hb[b[i][2]] -= w[i];
	del(hb[b[i][0]]), del(hb[b[i][1]]), del(hb[b[i][2]]);
}

int main() {
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= n; i++) scanf("%d%d%d", &a[i][0], &a[i][1], &a[i][2]);
	for (int i = 1; i <= n; i++) scanf("%d%d%d", &b[i][0], &b[i][1], &b[i][2]);
	for (int i = 1; i <= n; i++) w[i] = eng();
	for (int i = 1, j = 0; i <= n; i++) { for (; j <= n && !ans; upd(++j, 1)); p[i] = j, upd(i, -1); }
	for (int l, r; q--;) scanf("%d%d", &l, &r), puts(p[l] > r ? "Yes" : "No");
}