//qoj9155
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10, M = 6e5 + 10;
int n, m, q, a[N][3], b[N][3], rm[N];
typedef unsigned long long ll;
const ll P = 998244853, R = 337;
ll p[N], vx[M], vy[M];
int cnt;
unordered_map<ll, int> mp;

void add(int x){
	for(int i = 0; i <= 2; ++ i){
		if(mp[vx[a[x][i]]] == 0){
			-- cnt;
		} 
		-- mp[vx[a[x][i]]];
		if(mp[vx[a[x][i]]] == 0){
			++ cnt;
		} 
		vx[a[x][i]] = (vx[a[x][i]] + p[x]) % P;
		if(mp[vx[a[x][i]]] == 0){
			-- cnt;
		} 
		++ mp[vx[a[x][i]]];
		if(mp[vx[a[x][i]]] == 0){
			++ cnt;
		}
		if(mp[vy[b[x][i]]] == 0){
			-- cnt;
		} 
		++ mp[vy[b[x][i]]];
		if(mp[vy[b[x][i]]] == 0){
			++ cnt;
		} 
		vy[b[x][i]] = (vy[b[x][i]] + p[x]) % P;
		if(mp[vy[b[x][i]]] == 0){
			-- cnt;
		} 
		-- mp[vy[b[x][i]]];
		if(mp[vy[b[x][i]]] == 0){
			++ cnt;
		} 
	}
}

void del(int x){
	for(int i = 0; i <= 2; ++ i){
//		printf("-1- %lld %d\n", vx[a[x][i]], mp[vx[a[x][i]]]);
		if(mp[vx[a[x][i]]] == 0){
			-- cnt;
		} 
		-- mp[vx[a[x][i]]];
		if(mp[vx[a[x][i]]] == 0){
			++ cnt;
		} 
		vx[a[x][i]] = (vx[a[x][i]] + P - p[x]) % P;
		if(mp[vx[a[x][i]]] == 0){
			-- cnt;
		} 
		++ mp[vx[a[x][i]]];
		if(mp[vx[a[x][i]]] == 0){
			++ cnt;
		}
//		printf("-2- %lld %d\n", vx[a[x][i]], mp[vx[a[x][i]]]);
//		printf("-3- %lld %d\n", vy[b[x][i]], mp[vy[b[x][i]]]);
		if(mp[vy[b[x][i]]] == 0){
			-- cnt;
		} 
		++ mp[vy[b[x][i]]];
		if(mp[vy[b[x][i]]] == 0){
			++ cnt;
		} 
		vy[b[x][i]] = (vy[b[x][i]] + P - p[x]) % P;
		if(mp[vy[b[x][i]]] == 0){
			-- cnt;
		} 
		-- mp[vy[b[x][i]]];
		if(mp[vy[b[x][i]]] == 0){
			++ cnt;
		} 
//		printf("-4- %lld %d\n", vy[b[x][i]], mp[vy[b[x][i]]]);
	}
}

int main(){
	scanf("%d%d%d", &n, &m, &q);
	p[0] = 1;
	for(int i = 1; i <= n; ++ i){
		for(int j = 0; j < 3; ++ j){
			scanf("%d", &a[i][j]);
		}
		p[i] = p[i-1] * R % P;
	}
	for(int i = 1; i <= n; ++ i){
		for(int j = 0; j < 3; ++ j){
			scanf("%d", &b[i][j]);
		}
	}
	cnt = m;
	for(int l = 1, r = 0; l <= n; ++ l){
		while(r < n){
			++ r;
			add(r);
//			printf("%d %d %d\n%llu %llu %llu %llu\n", l, r, cnt, vx[1],vx[2],vx[3],vx[4]);
//			printf("%llu %llu %llu %llu\n", vy[1],vy[2],vy[3],vy[4]);
			if(cnt != m){
				del(r);
				-- r;
				break;
			}
		}
		rm[l] = r;
		del(l);
	}
	while(q--){
		int l, r;
		scanf("%d%d", &l, &r);
		if(rm[l] >= r){
			puts("Yes");
		} else {
			puts("No");
		}
	}
	return 0;
}