//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define sz(x) (int) (x).size()
#define int int64_t
#define i128 __int128_t
#define all(x) (x).begin(), (x).end()
mt19937_64 rng(16582934);

const int mxn=2e5+5;
const int mxm=6e5+5;
int index_hash[mxn];

int n,m,q,a[mxn][3],b[mxn][3];
i128 ahash[mxm],bhash[mxm];
int right_point[mxn];

i128 chash_a = 0, chash_b = 0;

void add_a(int x, int ind) {
	chash_a -= ahash[x];
	ahash[x] ^= index_hash[ind];
	chash_a += ahash[x];
}
void add_b(int x, int ind) {
	chash_b -= bhash[x];
	bhash[x] ^= index_hash[ind];
	chash_b += bhash[x];
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	for (int i=0; i<mxn; i++) {
		index_hash[i] = rng();
	}
	
	cin>>n>>m>>q;
	for (int i=0; i<n; i++)
		cin>>a[i][0]>>a[i][1]>>a[i][2];
	for (int i=0; i<n; i++)
		cin>>b[i][0]>>b[i][1]>>b[i][2];
	
	int rp=-1;
	for (int lp=0; lp<n; lp++) {
		while (chash_a == chash_b && rp < n) {
			rp++;
			for (int i=0; i<3; i++) {
				add_a(a[rp][i],rp);
				add_b(b[rp][i],rp);
			}
		}
		right_point[lp] = rp-1;
		for (int i=0; i<3; i++) {
			add_a(a[lp][i],lp);
			add_b(b[lp][i],lp);
		}
	}
	while (q--) {
		int l,r; cin>>l>>r; --l; --r;
		cout<<((r<=right_point[l])?"Yes":"No")<<"\n";
	}
    return 0;
}