#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#define fi first
#define se second
#define ins insert
#define it iterator
#define lb lower_bound
#define ub upper_bound
#define exc(exp) if(exp)continue;
#define ret(exp) if(exp)return;
#define stop(exp) if(exp)break;
#define quit(sth) {sth;return;}
#define let(var...) int var;tie(var)
#define siz(vec) ((int)((vec).size()))
#define all(vec) (vec).begin(),(vec).end()
#define unq(vec) sort(all(vec)),(vec).erase(unique(all(vec)),(vec).end())
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define db double
#define ll long long
#define int long long
#define ull unsigned long long
#define inf (long long)(1e18)
mt19937_64 gen(random_device{}());
bool Max(int &x,int y){if(x<y)return x=y,1;return 0;}
bool Min(int &x,int y){if(x>y)return x=y,1;return 0;}
const int mod=998244353;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
int add(int x,int y){return x+y<mod?x+y:x+y-mod;}
int fpm(int x,int y){
	int ans=1;for(;y;y>>=1,(x*=x)%=mod)if(y&1)(ans*=x)%=mod;return ans;
}

int n,m,q,a[200010][3],b[200010][3],w[200010][20];

ull xo[200010],hsha[600010],hshb[600010],suma,sumb;
void work(){
    cin>>n>>m>>q;
    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];

    for(int i=1,j=1;i<=n;i++){
        xo[i]=gen();
        for(int k=0;k<3;k++){
            int x=a[i][k],y=b[i][k];
            suma-=hsha[x],suma+=hsha[x]^=xo[i];
            sumb-=hshb[y],sumb+=hshb[y]^=xo[i];
        }
        while(j<=i&&suma!=sumb){
            for(int k=0;k<3;k++){
                int x=a[j][k],y=b[j][k];
                suma-=hsha[x],suma+=hsha[x]^=xo[j];
                sumb-=hshb[y],sumb+=hshb[y]^=xo[j];
            }                                               j++;
        }                           w[i][0]=j;
    }
    for(int k=1;k<20;k++){
        for(int i=1;i+(1<<k)-1<=n;i++)
            w[i][k]=max(w[i][k-1],w[i+(1<<(k-1))][k-1]);
    }
    while(q--){
        int l,r;
        cin>>l>>r;
        int lg=__lg(r-l+1);
        cout<<(max(w[l][lg],w[r-(1<<lg)+1][lg])<=l?"Yes\n":"No\n");
    }
}
signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T=1;while(T--)work();
}
/*
 * CONTINUE, NON-STOPPING, FOR THE FAITH
 * START TYPING IF YOU DON'T KNOW WHAT TO DO
 * STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
 */