#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
bool be;
random_device gen;
mt19937_64 rd(gen());
constexpr int N = 6e5 + 5, B1 = 911, B2 = 13331;
int n, m, Q, a[N], b[N], pos[N], prea[N], preb[N], nxta[N], nxtb[N], ans[N];
ull ha[N], hb[N], rk[N], sa, sb;
inline ull sqr(ull x)
{
	return x * x * x * x + x * x * x + x * x + x + (x ^ 12431786);
}
inline int Pos(int x)
{
	return (x + 2) / 3;
}
inline void ins(int x)
{
	sa = sa - sqr(ha[a[x]]) + sqr(ha[a[x]] + rk[Pos(x)]);
	sb = sb - sqr(hb[b[x]]) + sqr(hb[b[x]] + rk[Pos(x)]);
	ha[a[x]] += rk[Pos(x)], hb[b[x]] += rk[Pos(x)];	
}
inline void eras(int x)
{
	sa = sa - sqr(ha[a[x]]) + sqr(ha[a[x]] - rk[Pos(x)]);
	sb = sb - sqr(hb[b[x]]) + sqr(hb[b[x]] - rk[Pos(x)]);
	ha[a[x]] -= rk[Pos(x)], hb[b[x]] -= rk[Pos(x)];
}
bool en;
int main()
{
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n--------------------------------" << endl;
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m >> Q;
	for (int i = 1; i <= 3 * n; ++i) {
		rk[i] = rd();
	}
	for (int i = 1; i <= 3 * n; ++i) {
		cin >> a[i];
		prea[i] = pos[a[i]];
		nxta[pos[a[i]]] = i;
		pos[a[i]] = i;
	}
	for (int i = 1; i <= m; ++i) pos[i] = 0;
	for (int i = 1; i <= 3 * n; ++i) {
		cin >> b[i];
		preb[i] = pos[b[i]];
		nxtb[pos[b[i]]] = i;
		pos[b[i]] = i;
	}
	for (int l = 1, r = 0; l <= n; ++l) {
		while (r < n) {
			ins(r * 3 + 1);
			ins(r * 3 + 2);
			ins(r * 3 + 3);
			// cerr << l << ' ' << r + 1 << ' ' << sa << ' ' << sb << '\n';
			if (sa != sb) {
				eras(r * 3 + 1);
				eras(r * 3 + 2);
				eras(r * 3 + 3);
				break;
			}
			++r;
		}
		ans[l] = r;
		eras(l * 3 - 2);
		eras(l * 3 - 1);
		eras(l * 3);
	}
	while (Q--) {
		int l, r;
		cin >> l >> r;
		cout << (ans[l] >= r ? "Yes\n" : "No\n");
	}
	return 0;
}