#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int pos[maxn], p[maxn];
int nxt[maxn], head[maxn], a[maxn];
int l[maxn];
int n, m, q;
int tree[maxn << 2];
int rmq[maxn][30];
void build(int L, int R, int k) {
  if (L == R) {
    tree[k] = l[L];
    return;
  }
  int mid = L + R >> 1;
  build(L, mid, k * 2);
  build(mid + 1, R, k * 2 + 1);
  tree[k] = min(tree[k * 2], tree[k * 2 + 1]);
}
const int INF = 1e9 + 5;
int query(int l1, int r1, int L, int R, int k) {
  if (l1 > R || L > r1) return INF;
  if (l1 <= L && r1 >= R) return tree[k];
  int mid = L + R >> 1;
  return min(query(l1, r1, L, mid, k * 2),
             query(l1, r1, mid + 1, R, k * 2 + 1));
}
int main() {
  cin >> n >> m >> q;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    pos[p[i]] = i;
    head[i] = m + 1;
  }
  for (int i = 1; i <= m; i++) cin >> a[i];
  for (int i = m; i >= 1; i--) {
    int q = pos[a[i]] + 1;
    if (q == n + 1) q = 1;
    nxt[i] = head[p[q]];
    rmq[i][0] = nxt[i];
    head[a[i]] = i;
  }
  for (int i = 1; i <= 24; i++)
    for (int j = 1; j <= m; j++)
      if (rmq[j][i - 1] > m)
        rmq[j][i] = m + 1;
      else
        rmq[j][i] = rmq[rmq[j][i - 1]][i - 1];
  for (int i = 1; i <= m; i++) {
    int d = i, p = n;
    for (int j = 24; j >= 0; j--) {
      if (d > m) break;
      if ((1 << j) < p) {
        p -= 1 << j;
        d = rmq[d][j];
      }
    }
    l[i] = d;
  }
  build(1, m, 1);
  int L, R;
  while (q--) {
    cin >> L >> R;
    int d = query(L, R, 1, m, 1);
    if (d <= R)
      cout << 1;
    else
      cout << 0;
  }
}
