// Title:  集合
// Source: NOI2024
// Author: Jerrywang
#include <bits/stdc++.h>
#define ll unsigned long long
#define rep(i, s, t) for(int i=s; i<=t; ++i)
#define debug(x) cerr<<#x<<":"<<x<<endl;
const int N=200010, M=N*3;
using namespace std;
mt19937_64 rnd(time(0));

int n, m, T, a[N][3], b[N][3], rp[N];
ll h[N], suma, sumb, seta[M], setb[M];
ll Rnd(ll x)
{
    return x*131+x*x*233+x*x*x*57257;
}
void modify(int i, int d)
{
    rep(j, 0, 2)
    {
        int x=a[i][j];
        suma-=Rnd(seta[x]);
        seta[x]+=h[i]*d;
        suma+=Rnd(seta[x]);
    }
    rep(j, 0, 2)
    {
        int x=b[i][j];
        sumb-=Rnd(setb[x]);
        setb[x]+=h[i]*d;
        sumb+=Rnd(setb[x]);
    }
}

int main()
{
#ifdef Jerrywang
    freopen("in.txt", "r", stdin);
#endif
    scanf("%d%d%d", &n, &m, &T);
    rep(i, 1, n) h[i]=rnd();
    rep(i, 1, n) rep(j, 0, 2) scanf("%d", &a[i][j]);
    rep(i, 1, n) rep(j, 0, 2) scanf("%d", &b[i][j]);
    int j=1; modify(1, 1);
    rep(i, 1, n)
    {
        while(j<=n && suma==sumb)
            j++, modify(j, 1);
        modify(j, -1), j--;
        rp[i]=j; modify(i, -1);
    }
    while(T--)
    {
        int l, r; scanf("%d%d", &l, &r);
        puts(rp[l]>=r?"Yes":"No");
    }

    return 0;
}