#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
constexpr int N = 200010, M = 600010, mod = 998244353;
int n, m, Q, maxr[N];
ll pt[N], Hash1[M], Hash2[M];
struct Node
{
    int a, b, c;
    Node() : a(0), b(0), c(0) {}
    Node(int a_, int b_, int c_) : a(a_), b(b_), c(c_) {}
} A[N], B[N], tmp[N];
gp_hash_table<ll, int> f, g;
int main()
{
    cin >> n >> m >> Q;
    pt[0] = 1;
    for (int i = 1; i <= n; i++)
        pt[i] = 131 * pt[i - 1] % mod;
    for (int i = 1; i <= n; i++)
        cin >> A[i].a >> A[i].b >> A[i].c;
    for (int i = 1; i <= n; i++)
        cin >> B[i].a >> B[i].b >> B[i].c;
    for (int l = 1; l <= n; l++)
    {
        for (int r = maxr[l - 1] + 1; r <= n; r++)
        {
            ll Alsta = Hash1[A[r].a], Alstb = Hash1[A[r].b], Alstc = Hash1[A[r].c], Ana, Anb, Anc;
            Ana = Hash1[A[r].a] = (Alsta + pt[r]) % mod;
            Anb = Hash1[A[r].b] = (Alstb + pt[r]) % mod;
            Anc = Hash1[A[r].c] = (Alstc + pt[r]) % mod;
            --f[Alsta], --f[Alstb], --f[Alstc];
            ++f[Ana], ++f[Anb], ++f[Anc];

            ll Blsta = Hash2[B[r].a], Blstb = Hash2[B[r].b], Blstc = Hash2[B[r].c], Bna, Bnb, Bnc;
            Bna = Hash2[B[r].a] = (Blsta + pt[r]) % mod;
            Bnb = Hash2[B[r].b] = (Blstb + pt[r]) % mod;
            Bnc = Hash2[B[r].c] = (Blstc + pt[r]) % mod;
            --g[Blsta], --g[Blstb], --g[Blstc];
            ++g[Bna], ++g[Bnb], ++g[Bnc];
            if (f[Alsta] != g[Alsta] || f[Alstb] != g[Alstb] || f[Alstc] != g[Alstc] || f[Ana] != g[Ana] || f[Anb] != g[Anb] || f[Anc] != g[Anc])
            {
                ++f[Alsta], ++f[Alstb], ++f[Alstc];
                --f[Ana], --f[Anb], --f[Anc];
                ++g[Blsta], ++g[Blstb], ++g[Blstc];
                --g[Bna], --g[Bnb], --g[Bnc];
                Hash1[A[r].a] = Alsta, Hash1[A[r].b] = Alstb, Hash1[A[r].c] = Alstc;
                Hash2[B[r].a] = Blsta, Hash2[B[r].b] = Blstb, Hash2[B[r].c] = Blstc;
                break;
            }
            maxr[l] = r;
        }
        maxr[l + 1] = maxr[l];
        ll Alsta = Hash1[A[l].a], Alstb = Hash1[A[l].b], Alstc = Hash1[A[l].c], Ana, Anb, Anc;
        Ana = Hash1[A[l].a] = ((Alsta - pt[l]) % mod + mod) % mod;
        Anb = Hash1[A[l].b] = ((Alstb - pt[l]) % mod + mod) % mod;
        Anc = Hash1[A[l].c] = ((Alstc - pt[l]) % mod + mod) % mod;
        --f[Alsta], --f[Alstb], --f[Alstc];
        ++f[Ana], ++f[Anb], ++f[Anc];

        ll Blsta = Hash2[B[l].a], Blstb = Hash2[B[l].b], Blstc = Hash2[B[l].c], Bna, Bnb, Bnc;
        Bna = Hash2[B[l].a] = ((Blsta - pt[l]) % mod + mod) % mod;
        Bnb = Hash2[B[l].b] = ((Blstb - pt[l]) % mod + mod) % mod;
        Bnc = Hash2[B[l].c] = ((Blstc - pt[l]) % mod + mod) % mod;
        --g[Blsta], --g[Blstb], --g[Blstc];
        ++g[Bna], ++g[Bnb], ++g[Bnc];
    }
    while (Q--)
    {
        int l, r;
        cin >> l >> r;
        cout << (maxr[l] >= r ? "Yes" : "No") << endl;
    }
    return 0;
}