// Problem: P10785 [NOI2024] 集合
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P10785
// Memory Limit:  MB
// Time Limit:  ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define eb emplace_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
bool Mbe;

mt19937 rnd(time(0));
const int N = 2e5 + 5;
const int M = 6e5 + 5;

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

ull f[N], pa[M], pb[M], A, B;
unordered_map<ull, ull> h;

ull myr() {
	return ((ull)rnd() << 32) + rnd();
}

ull g(ull x) {
	if (h.find(x) == h.end()) h[x] = myr();
	return h[x];
}

void add(int x, ull op) {
	for (int i = 0; i <= 2; i++) {
		A -= g(pa[a[x][i]]), B -= g(pb[b[x][i]]);
		pa[a[x][i]] += f[x] * op;
		pb[b[x][i]] += f[x] * op;
		A += g(pa[a[x][i]]), B += g(pb[b[x][i]]);
	}
}

void solve() {
	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++) f[i] = myr();
	for (int i = 1, j = 0; i <= n; i++) {
		while (j + 1 <= n && (A == B)) add(++j, 1);
		if (A != B) add(j--, -1);
		res[i] = j, add(i, -1);
	}
	while (q--) {
		int l, r; cin >> l >> r;
		if (res[l] >= r) cout << "Yes\n";
		else cout << "No\n";
	}
}

bool Med;
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}