#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define infl 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()


#define ll long long
#define ull unsigned ll


//#define dprintf printf
#define dprintf(args...) 59
mt19937_64 rng(42);

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

 //chinese io here we come
#define BUFSZ (1<<21)
char ib[BUFSZ], *ip=ib+BUFSZ;
char ob[BUFSZ], *op=ob;
#define gc() (ip==ib+BUFSZ?(fread(ip=ib,BUFSZ,1,stdin),*ip++):*ip++)

int read() {
        char c; while((c=gc())<'0');
        int x=c-'0';
        while((c=gc())>='0')x=x*10+(c-'0');
        return x;
}
struct { template<class T> operator T() { T x; cin>>x; return x; } } in;
//struct { operator int() { return read(); } } in;

void write(const string&& s) {
        for(auto x:s)*op++=x;
}
void flush() {
        fwrite(ob,op-ob,1,stdout);
        op=ob;
}


#define N int(2e5)
#define M int(6e5)
int a[N][3]; int b[N][3];
ull eh[N]; ull ha[M], hb[M];

int ans[N];
//map<int,int> ga, gb;
gp_hash_table<int,int> ga,gb;

int bad=0;
int n,m,qq;

int main()
{
        n=in, m=in, qq=in;

        for(int i=0;i<n;i++) for(int j=0;j<3;j++)a[i][j]=in,a[i][j]--;
        for(int i=0;i<n;i++) for(int j=0;j<3;j++)b[i][j]=in,b[i][j]--;
        for(int i=0;i<n;i++) {
                //eh[i]=1ull<<i;
                eh[i] = rng();
        }

        auto alter = [&](int j) -> void {
                dprintf("alter %d\n",j);
                //set<int> cs;
                vector<int> cs;
                for(auto k : a[j]) {
                        cs.push_back(ha[k]);
                        cs.push_back(ha[k]^eh[j]);
                }
                for(auto k : b[j]) {
                        cs.push_back(hb[k]);
                        cs.push_back(hb[k]^eh[j]);
                }
                sort(all(cs));
                cs.erase(unique(all(cs)),cs.end());
                for(auto x : cs) {
                        if(ga[x] != gb[x]) bad--;
                }
                for(auto x : a[j]) {
                        ga[ha[x]]--;
                        if(ga[ha[x]]==0)ga.erase(ha[x]);
                        ha[x] ^= eh[j];
                        ga[ha[x]]++;
                }
                for(auto x : b[j]) {
                        gb[hb[x]]--;
                        if(ga[hb[x]]==0)ga.erase(hb[x]);
                        hb[x] ^= eh[j];
                        gb[hb[x]]++;
                }
                for(auto x : cs) {
                        if(ga[x] != gb[x]) bad++;
                }
        };

        for(int i=0;i<m;i++) dprintf("%d ", ha[i]%100);
        dprintf("\n");
        for(int i=0;i<m;i++) dprintf("%d ", hb[i]%100);
        dprintf("\n");
        int j=-1;
        for(int i=0;i<n;i++) {
                while(j<n && !bad) {
                        dprintf("(%d, %d)\n",i,j);
                        for(int i=0;i<m;i++) dprintf("%d ", ha[i]%100);
                        dprintf("\n");
                        for(int i=0;i<m;i++) dprintf("%d ", hb[i]%100);
                        dprintf("\n");
                        dprintf("\t\t%d bad\n",bad);
                        j++;
                        if(j<n)alter(j);
                }
                for(int i=0;i<m;i++) dprintf("%d ", ha[i]%100);
                dprintf("\n");
                for(int i=0;i<m;i++) dprintf("%d ", hb[i]%100);
                dprintf("\n");
                dprintf("\t\t%d bad\n",bad);
                ans[i] = j;
                dprintf("ans %d = %d\n", i, j);
                alter(i);
        }

        while(qq--) {
                int l=in, r=in;
                l--; r--;

                if(r<ans[l]) {
                        write("Yes\n");
                        //puts("Yes");
                }
                else {
                        write("No\n");
                        //puts("No");
                }
                if(qq%10000==0) flush();
        }
        return flush(),0;
}