#include <cstdio>
#include <random>
#include <ctime>
#define N 600005
#define uid() uniform_int_distribution<unsigned long long>()(rnd)
using namespace std;

const int k = 3;

int n, m, q, a[N], b[N], r[N];
unsigned long long mp[k][N], vala[k][N], valb[k][N], nowa[k], nowb[k];

mt19937 rnd (time (0));

bool eq (unsigned long long *a, unsigned long long *b)
{
	for (int i = 0; i < k; i ++)
	{
		if (a[i] != b[i]) return 0;
	}
	return 1;
}

void insert (int i)
{
	for (int j = (i - 1) * 3 + 1; j <= i * 3; j ++)
	{
		for (int u = 0; u < k; u ++)
		{
			nowa[u] -= vala[u][a[j]];
			vala[u][a[j]] ^= mp[u][i];
			nowa[u] += vala[u][a[j]];
			nowb[u] -= valb[u][b[j]];
			valb[u][b[j]] ^= mp[u][i];
			nowb[u] += valb[u][b[j]];
		}
	}
	return ;
}

int main ()
{
	scanf ("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= n; i ++)
	{
		for (int j = 0; j < k; j ++)
		{
			mp[j][i] = uid ();
		}
	}
	for (int i = 1; i <= n * 3; i ++)
	{
		scanf ("%d", &a[i]);
	}
	for (int i = 1; i <= n * 3; i ++)
	{
		scanf ("%d", &b[i]);
	}
	for (int i = 1, j = 0; i <= n; i ++)
	{
		while (j < n)
		{
			insert (j + 1);
			if (eq (nowa, nowb)) j ++;
			else {insert (j + 1); break;}
		}
		r[i] = j, insert (i);
	}
	for (int i = 1, x, y; i <= q; i ++)
	{
		scanf ("%d%d", &x, &y);
		puts (y <= r[x] ? "Yes" : "No");
	}
	return 0;
}