#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5, MAXM = 6e5 + 5, MAXQ = 1e6 + 5, MOD = 998244353;
int read(){
    char c = getchar();
    while (c > '9' || c < '0')
        c = getchar();
    int res = 0;
    while (c >= '0' && c <= '9'){
        res = (res << 3) + (res << 1) + (c ^ 48);
        c = getchar();
    }
    return res;
}
long long qpow(long long a, long long b){
    long long res = 1;
    for (; b; b >>= 1, a = a * a % MOD)
        if (b & 1)
            res = res * a % MOD;
    return res;
}
long long base, p;
int a[MAXN][3], b[MAXN][3];
long long ha[MAXM], hb[MAXM];
long long bp[MAXN], olda[MAXM], oldb[MAXM];
long long numa = 0, numb = 0;
int cnt = 0;
void insert(int id, int k){
    cnt++;
    for (int i = 0; i < 3; i++){
        int x = a[id][i];
        numa -= olda[x];
        ha[x] += bp[id] * k; ha[x] = (ha[x] + MOD) % MOD;
        olda[x] = qpow(p, ha[x]);
        numa += olda[x]; numa = (numa % MOD + MOD) % MOD;
    }
    for (int i = 0; i < 3; i++){
        int x = b[id][i];
        numb -= oldb[x];
        hb[x] += bp[id] * k; hb[x] = (hb[x] + MOD) % MOD;
        oldb[x] = qpow(p, hb[x]);
        numb += oldb[x]; numb = (numb % MOD + MOD) % MOD;
    }
}
int ans[MAXN];
mt19937 rnd(time(0));
int main(){
    base = rnd() % MOD, p = rnd() % MOD;
    int n = read(), m = read(), q = read();
    bp[0] = 1;
    for (int i = 1; i <= n; i++)
        bp[i] = bp[i - 1] * base % MOD;
    for (int i = 1; i <= m; i++)
        olda[i] = oldb[i] = 1;
    for (int i = 1; i <= n; i++)
        a[i][0] = read(), a[i][1] = read(), a[i][2] = read();
    for (int i = 1; i <= n; i++)
        b[i][0] = read(), b[i][1] = read(), b[i][2] = read();
    int r = 0;
    for (int l = 1; l <= n; l++){
        while (numa == numb && r < n){
            r++;
            insert(r, 1);
        }
        ans[l] = r - (numa != numb);
        insert(l, -1);
    }
    while (q--){
        int l = read(), r = read();
        if (r <= ans[l])
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    return 0;
}