#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=200007,M=600007;

vector<int>A[N],B[N];
int R[N];

int id[M];
vector<int>sA[10*N];
vector<int>sB[10*N];

int it;

int used[M];

bool is[M];

bool isA[M];
bool isB[M];

bool takenA[M];
bool takenB[M];

struct mem
{
    int x,it1;
    vector<pair<int,int>>C;
};

vector<mem>S;

int Rollback()
{
    int X=S.back().x;
    it-=S.back().it1;
    for(auto i:B[X]) used[i]--;
    for(auto [i,x]:S.back().C) id[i]=x;
    S.pop_back();
    return X;
}

void add(int x)
{
    mem xd;
    xd.x=x;
    xd.it1=0;
    debug(x);
    vector<int>P;
    for(auto i:A[x])
    {
        debug(i,id[i],is[id[i]]);
        if(!is[id[i]]&&id[i]!=0) P.pb(id[i]);
        is[id[i]]=1;
        isA[i]=1;
    }
    for(auto i:B[x]) isB[i]=1;
    for(auto p:P)
    {
        debug(p);
        vector<int>A1,B1,A2,B2;
        for(auto i:sA[p])
        {
            if(isA[i]) A1.pb(i);
            else A2.pb(i);
        }
        for(auto i:sB[p])
        {
            if(isB[i]) B1.pb(i);
            else B2.pb(i);
        }
        it++,xd.it1++;
        sA[it]=A1,sB[it]=B1;
        for(auto i:sA[it])
        {
            xd.C.pb({i,id[i]});
            id[i]=it;
        }
        for(auto i:A1) takenA[i]=1;
        for(auto i:B1) takenB[i]=1;
        if(sz(A2)>0)
        {
            it++,xd.it1++;
            sA[it]=A2,sB[it]=B2;
            for(auto i:sA[it])
            {
                xd.C.pb({i,id[i]});
                id[i]=it;
            }
        }
    }
    vector<int>A1,B1;
    for(auto i:A[x]) if(!takenA[i]) A1.pb(i);
    for(auto i:B[x]) if(!takenB[i]) B1.pb(i);
    if(sz(A1)>0)
    {
        it++,xd.it1++;
        sA[it]=A1,sB[it]=B1;
        for(auto i:sA[it])
        {
            xd.C.pb({i,id[i]});
            id[i]=it;
        }
    }
    for(auto i:A[x])
    {
        isA[i]=0;
        takenA[i]=0;
    }
    for(auto i:B[x])
    {
        isB[i]=0;
        takenB[i]=0;
        used[i]++;
    }
    for(auto i:P) is[i]=0;
    S.pb(xd);
}

bool check(int x)
{
    bool OK=1;
    vector<int>P;
    for(auto i:A[x])
    {
        if(!is[id[i]]&&id[i]!=0) P.pb(id[i]);
        is[id[i]]=1;
        isA[i]=1;
    }
    for(auto i:B[x]) isB[i]=1;
    for(auto p:P)
    {
        debug(p);
        vector<int>A1,B1,A2,B2;
        for(auto i:sA[p])
        {
            if(isA[i]) A1.pb(i);
            else A2.pb(i);
        }
        for(auto i:sB[p])
        {
            if(isB[i]) B1.pb(i);
            else B2.pb(i);
        }
        if(sz(A1)!=sz(B1)) OK=0;
        for(auto i:A1) takenA[i]=1;
        for(auto i:B1) takenB[i]=1;
    }
    vector<int>A1,B1;
    for(auto i:A[x]) if(!takenA[i]) A1.pb(i);
    for(auto i:B[x]) if(!takenB[i]) B1.pb(i);
    if(sz(A1)>0)
    {
        for(auto i:B1) if(used[i]) OK=0;
    }
    for(auto i:A[x])
    {
        isA[i]=0;
        takenA[i]=0;
    }
    for(auto i:B[x])
    {
        isB[i]=0;
        takenB[i]=0;
    }
    for(auto i:P) is[i]=0;
    if(OK) add(x);
    return OK;
}


signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m,q;
	cin>>n>>m>>q;
    FOR(i,1,n)
    {
        A[i].resize(3);
        FOR(j,0,2) cin>>A[i][j];
    }
    FOR(i,1,n)
    {
        B[i].resize(3);
        FOR(j,0,2) cin>>B[i][j];
    }
    int j=0;
    FOR(i,1,n)
    {
        while(j<n&&check(j+1)) j++;
        R[i]=j;
        debug(j);
        vector<int>V;
        int ile=0;
        while(true)
        {
            int x=Rollback();
            if(x==i) break;
            ile++;
            V.pb(x);
        }
        while(sz(S)>0&&ile>0)
        {
            V.pb(Rollback());
            ile--;
        }
        sort(all(V),greater<int>());
        for(auto x:V) add(x);
    }
    while(q--)
    {
        int l,r;
        cin>>l>>r;
        if(R[l]>=r) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }

	return 0;
}