#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 6e5 + 5, K = 13131;
const ll mod = 1e12 + 39;
int n, m, q, a[N][3], b[N][3], R[N];
ll h[N], A[N], B[N], sa, sb;
ll F(ll x) 
{
    unsigned long long t = x;
    t ^= t >> 5;
    t ^= t << 14;
    t ^= t >> 27;
    t ^= t << 39;
    x = (t % mod);
    return x;
}
void add(ll w[], ll& s, ll v, int p, int t) {s -= F(w[p]); w[p] += t * v; s += F(w[p]);}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m >> q; h[0] = 1;
    for (int i = 1; i <= n; i++) h[i] = h[i-1] * K % mod;
    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 l = 1, r = 0; l <= n; l++)
    {
        if (r < l - 1) r = l - 1;
        if (r < n)
        {
            do
            {
                r++;
                for (int j = 0; j < 3; j++) add(A, sa, h[r], a[r][j], 1);
                for (int j = 0; j < 3; j++) add(B, sb, h[r], b[r][j], 1);
            }
            while (r < n && sa == sb);
        }
        if (sa != sb) 
        {
            for (int j = 0; j < 3; j++) add(A, sa, h[r], a[r][j], -1);
            for (int j = 0; j < 3; j++) add(B, sb, h[r], b[r][j], -1);
            r--;
        }
        R[l] = r;
        for (int j = 0; j < 3; j++) add(A, sa, h[l], a[l][j], -1);
        for (int j = 0; j < 3; j++) add(B, sb, h[l], b[l][j], -1);
    }
    while (q--)
    {
        int l, r; cin >> l >> r;
        cout << (r <= R[l] ? "Yes" : "No") << "\n";
    }
    return 0;
}