#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <random>
#include <cstdlib>
#define int long long
#define ull unsigned int
#define endl '\n'
#define lson 2*i
#define rson 2*i+1
#define debug(x) cerr << #x << " = " <<  x << "\n";
#define debug2(l,r) cerr << "[" #l "," #r "] = [" << l << "," << r << "]\n";
#define debug3(x,y,z) cerr << "{" #x "," #y "," #z "} = " << "{" << x << "," << y << "," << z << "}\n";
#define debugv(v) cerr << #v": size= " << v.size() << "\nelement: " ; for(auto p:v)  cerr << p << " ";
using namespace std;
const int N = 2e5 + 55, M = 6e5 + 55, Q = 1e6 + 55, MOD = 1e9 + 7, INF = 1e18;
int n, m, q, a[N][4], b[N][4];
ull c[M], d[M], ar[N], br[N];
bool ans[Q];
bool func(int x) {
    ull ha = 0, hb = 0;
    for (int i = 1; i <= 3; i++) {
        int t = a[x][i];
        ha -= c[t];
        c[t] ^= ar[x];
        ha += c[t];
    }
    for (int i = 1; i <= 3; i++) {
        int t = b[x][i];
        hb -= d[t];
        d[t] ^= ar[x];
        hb += d[t];
    }
    if (ha == hb) return true;
    for (int i = 1; i <= 3; i++)
        c[a[x][i]] ^= ar[x];
    for (int i = 1; i <= 3; i++)
        d[b[x][i]] ^= ar[x];
    return false;
}
void Delete(int x) {
   for (int i = 1; i <= 3; i++)
        c[a[x][i]] ^= ar[x];
    for (int i = 1; i <= 3; i++)
        d[b[x][i]] ^= ar[x];
}
mt19937_64 rd(random_device{}());
struct node {
    int x, i;
};
vector<node> g[N];
signed main() {
	cin.tie(0), ios_base::sync_with_stdio(false);
	cin >> n >> m >> q;
	for (int i = 1; i <= n; i++)
        ar[i] = rd();
	for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 3; j++)
            cin >> a[i][j];
	}
	for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 3; j++)
            cin >> b[i][j];
	}
    for (int i = 1, l, r; i <= q; i++) {
        cin >> l >> r;
        g[l].push_back({r, i});
    }
    for (int i = 1, j = 0; i <= n; i++) {
        while (j < n) {
            if (func(j + 1)) j++;
            else break;
        }
        for (int k = 0; k < g[i].size(); k++) {
            int x = g[i][k].x;
            ans[g[i][k].i] = x <= j;
        }
        Delete(i);
    }
    for (int i = 1; i <= q; i++) {
        if (ans[i]) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
	return 0;
}