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

typedef unsigned long long ull;
const ull B1 = 23333333;
const ull B2 = 19260817;
const ull mod = 998244353;
const int maxn = 2e5 + 5;
const int maxm = 6e5 + 5;

int A[maxn][3], B[maxn][3];
int rpos[maxn];

ull hsh[maxm][2], mi[maxn], Ha, Hb;
ull fpow(ull a, ull b)
{
    ull ans = 1;
    while (b)
    {
        if (b & 1) ans = ans * a;
        a = a * a; b >>= 1;
    }
    return ans;
}

void add(int pos, int op)
{
    for (int i = 0; i < 3; i++)
    {
        Ha -= fpow(B2, hsh[A[pos][i]][0]);
        (hsh[A[pos][i]][0] += (op ? mi[pos] : mod - mi[pos])) %= mod;
        Ha += fpow(B2, hsh[A[pos][i]][0]);

        Hb -= fpow(B2, hsh[B[pos][i]][1]);
        (hsh[B[pos][i]][1] += (op ? mi[pos] : mod - mi[pos])) %= mod;
        Hb += fpow(B2, hsh[B[pos][i]][1]);
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m, q;
    cin >> n >> m >> q;
    mi[0] = 1; for (int i = 1; i <= n; i++) mi[i] = mi[i - 1] * B1 % mod;
    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];

    int pos = 1; add(1, 1);
    for (int i = 1; i <= n; i++)
    {
        while (pos < n && Ha == Hb) add(++pos, 1);
        if (pos == n && Ha == Hb) rpos[i] = n + 1; else rpos[i] = pos; add(i, 0);
    }
    while (q--)
    {
        int l, r; cin >> l >> r;
        cout << (r >= rpos[l] ? "No" : "Yes") << "\n";
    }
    return 0;
}