#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define PII pair<int, int>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define ROF(i, r, l) for (int i = (r); i >= (l); --i)
#define FI first
#define SE second
#define SZ size()
#define ull unsigned long long
using namespace std;
const int N = 2e5 + 5;
const int M = 6e5 + 5;
const ull P = 1e9 + 9;
int n, mn[N], m, q, a[N][3], b[N][3], cnt;
ull pw[N], ha[M], hb[M];
unordered_map<ull, int> A, B;
unordered_map<ull, bool> qc;
void clean_up(int x, int k) {
    qc.clear();
    FOR (i, 0, 2) {
        int s = a[x][i];
        if (!qc[ha[s]]) {
            qc[ha[s]] = 1;
            cnt += (A[ha[s]] != B[ha[s]]) * k; 
        } 
        s = b[x][i];
        if (!qc[hb[s]]) {
            qc[hb[s]] = 1;
            cnt += (A[hb[s]] != B[hb[s]]) * k; 
        } 
    }
}
void add(int x) {
    clean_up(x, -1);
    FOR (i, 0, 2) {
        A[ha[a[x][i]]]--;
        B[hb[b[x][i]]]--;
    }
    clean_up(x, 1);
    FOR (i, 0, 2) {
        int s = a[x][i];
        ha[s] -= pw[x];
        s = b[x][i];
        hb[s] -= pw[x];
    }
    clean_up(x, -1);
    FOR (i, 0, 2) {
        A[ha[a[x][i]]]++;
        B[hb[b[x][i]]]++;
    }
    clean_up(x, 1);
}
void sub(int x) {
    clean_up(x, -1);
    FOR (i, 0, 2) {
        A[ha[a[x][i]]]--;
        B[hb[b[x][i]]]--;
    }
    clean_up(x, 1);
    FOR (i, 0, 2) {
        int s = a[x][i];
        ha[s] += pw[x];
        s = b[x][i];
        hb[s] += pw[x];
    }
    clean_up(x, -1);
    FOR (i, 0, 2) {
        A[ha[a[x][i]]]++;
        B[hb[b[x][i]]]++;
    }
    clean_up(x, 1);
}
void solve() {
    int l = 1;
    ull all = 0;
    FOR (i, 1, n) all += pw[i];
    A[all] = B[all] = m;
    FOR (i, 1, m) ha[i] = hb[i] = all;
    FOR (r, 1, n) {
        add(r);
//        FOR (i, 1, m) {
//        	cout << ha[i] << ' ';
//		}
//		cout << '\n';
//		FOR (i, 1, m) {
//			cout << hb[i] << ' ';
//		}
//		cout << '\n';
//      cout << cnt << '\n';
        while (cnt > 0) sub(l++);
        mn[r] = l;
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m >> q;
    pw[0] = 1;
    FOR (i, 1, n) pw[i] = pw[i - 1] * P;
    FOR (i, 1, n) {
        FOR (j, 0, 2) {
            cin >> a[i][j];
        }
    }
    FOR (i, 1, n) {
        FOR (j, 0, 2) {
            cin >> b[i][j];
        }
    }
    solve();
    FOR (i, 1, q) {
        int l, r;
        cin >> l >> r;
        if (mn[r] <= l) cout << "Yes\n";
        else cout << "No\n";
    }
    return 0;
}