#include <bits/stdc++.h>
using namespace std;
class SegTree {
 private:
  int tree[(1 << 19)];

 public:
  SegTree(int N) {
    for (int i = 0; i < (1 << 19); i++) tree[i] = 200005;
  }
  int get_val(int l, int r, int a, int b, int ind) {
    if (a <= l && r <= b) {
      return (tree[ind]);
    }
    if (a > r || b < l) {
      return (200005);
    }
    int leftS = get_val(l, (l + r) / 2, a, b, 2 * ind);
    int rightS = get_val((l + r) / 2 + 1, r, a, b, 2 * ind + 1);
    return (min(leftS, rightS));
  }
  int query(int a, int b) { return (get_val(0, 200005, a, b, 1)); }
  void change_val(int l, int r, int newVal, int ind, int tmp) {
    if (tmp > r || tmp < l) {
      return;
    }
    if (l == r) {
      tree[ind] = newVal;
      return;
    }
    change_val(l, (r + l) / 2, newVal, 2 * ind, tmp);
    change_val((r + l) / 2 + 1, r, newVal, 2 * ind + 1, tmp);
    tree[ind] = min(tree[2 * ind], tree[2 * ind + 1]);
  }
  void update(int ind, int val) { change_val(0, 200005, val, 1, ind); }
};
int bin[200005 + 5][22], perm[200005], nxt[200005], ar[200005], recent[200005],
    ans[200005];
int N, M, Q;
int main() {
  cin >> N >> M >> Q;
  for (int i = 0; i < N; i++) {
    cin >> perm[i];
    recent[i + 1] = 200005;
    if (i > 0) nxt[perm[i - 1]] = perm[i];
  }
  nxt[perm[N - 1]] = perm[0];
  for (int i = 0; i < M; i++) cin >> ar[i];
  for (int i = 0; i <= 200005; i++)
    for (int j = 0; j <= 20; j++) bin[i][j] = 200005;
  for (int i = M - 1; i >= 0; i--) {
    bin[i][0] = i;
    bin[i][1] = recent[nxt[ar[i]]];
    recent[ar[i]] = i;
  }
  for (int ii = 2; ii <= 20; ii++) {
    for (int i = 0; i < M; i++) bin[i][ii] = bin[bin[i][ii - 1]][ii - 1];
  }
  for (int i = 0; i < M; i++) {
    ans[i] = i;
    int sum = N - 1;
    for (int j = 19; j >= 0; j--) {
      if (sum >= (1 << j)) {
        ans[i] = bin[ans[i]][j + 1];
        sum -= (1 << j);
      }
    }
  }
  SegTree seg(200005);
  for (int i = 0; i < M; i++) seg.update(i, ans[i]);
  string str = "";
  int l, r;
  for (int i = 0; i < Q; i++) {
    cin >> l >> r;
    l--;
    r--;
    str += ((seg.query(l, r) <= r) ? "1" : "0");
  }
  cout << str << endl;
  return (0);
}
