#include <bits/stdc++.h>
#define F(a,b)for(int a=0;a<b;a++)
#define G F(k,3)F(l,2)
#define B a[l][j][k]
using namespace std;
mt19937 g;
int u[2][1 << 20], n, m, q, j, x[2][3];
int main() {
    cin >> n >> m >> q, m++;
    int a[2][n][3], h[n], z[n];
    F(l, 2)F(j, n) {
        F(k, 3)cin >> B;
        h[j] = rand();
    }
    F(i, n) {
        while (j < n) {
            G x[l][k] = u[l][B];
            F(k, 2)sort(x[k], x[k] + 3);
            m = 0;

            F(k, 3)if (x[0][k]^x[1][k])
                m = 1;

            if (m)
                break;

            G u[l][B] ^= h[j];
            j++;
        }

        z[i] = j;
        G u[l][a[l][i][k]] ^= h[i];
    }
    F(i, q)cin >> n >> m, cout << (z[n - 1] < m ? "No\n" : "Yes\n");
}