#include <bits/stdc++.h>
using namespace std;
template <class T>
void show(const vector<T> &a) {
  for (T x : a) cout << x << " ";
  cout << '\n';
}
const long long sze = 3e5 + 50, oo = 1e18 + 500, mod = 1e9 + 7;
const long double eps = 1e-9, PI = 2 * acos(0.0);
vector<long long> vertices[sze];
vector<long long> visit(sze, 0);
vector<char> used(sze, false);
vector<long long> arr(sze, 0);
long long n, m, k;
long long A, B;
long long cnt = 0;
const long long N = 1 << 18;
vector<long long> t(N << 1, oo);
void build(vector<long long> &a) {
  for (long long i = 0; i < m; i++) {
    t[i + N] = a[i];
  }
  for (long long i = N - 1; i; i--) {
    t[i] = min(t[i << 1], t[i << 1 | 1]);
  }
}
long long get(long long v, long long tl, long long tr, long long l,
              long long r) {
  if (tl == l && tr == r) {
    return t[v];
  }
  long long md = (tl + tr) >> 1;
  long long ans = oo;
  if (l <= md) {
    ans = min(ans, get(v << 1, tl, md, l, min(r, md)));
    ;
  }
  if (r > md) {
    ans = min(ans, get(v << 1 | 1, md + 1, tr, max(l, md + 1), r));
    ;
  }
  return ans;
}
long long dp[sze][20];
signed main() {
  ios::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> m >> k;
  vector<long long> p(n), a(m);
  vector<long long> nxt(n + 10);
  for (long long i = 0; i < n; i++) {
    cin >> p[i];
  }
  for (long long i = 0; i < n - 1; i++) {
    nxt[p[i]] = p[i + 1];
  }
  nxt[p[n - 1]] = p[0];
  vector<long long> ptr(n + 10, 0);
  for (long long i = 0; i < m; i++) {
    cin >> a[i];
    vertices[a[i]].push_back(i);
  }
  for (long long i = 0; i < m; i++) {
    long long v = nxt[a[i]];
    while (ptr[v] < ((long long)(vertices[v].size())) &&
           vertices[v][ptr[v]] < i) {
      ptr[v]++;
    }
    if (ptr[v] < ((long long)(vertices[v].size()))) {
      a[i] = vertices[v][ptr[v]];
    } else {
      a[i] = oo;
    }
  }
  for (long long i = 0; i <= m; i++) {
    for (long long j = 0; j < 20; j++) {
      dp[i][j] = oo;
    }
  }
  for (long long i = m - 1; i >= 0; i--) {
    dp[i][0] = a[i];
    for (long long j = 1; j < 20; j++) {
      if (dp[i][j - 1] != oo)
        dp[i][j] = dp[dp[i][j - 1]][j - 1];
      else
        break;
    }
  }
  for (long long i = 0; i < m; i++) {
    long long val = n - 2;
    long long ind = i;
    for (long long j = 19; j >= 0; j--) {
      if (1 << j <= val) {
        ind = dp[ind][j];
        val -= 1 << j;
        if (ind == oo) break;
      }
    }
    if (ind != oo)
      a[i] = a[ind];
    else
      a[i] = oo;
  }
  vector<long long> leftmost(m);
  leftmost[m - 1] = a[m - 1];
  for (long long i = m - 2; i >= 0; i--) {
    leftmost[i] = min(a[i], leftmost[i + 1]);
  }
  string ans;
  for (long long i = 0; i < k; i++) {
    long long l, r;
    cin >> l >> r;
    l--, r--;
    long long mn = leftmost[l];
    if (mn <= r) {
      ans += '1';
    } else {
      ans += '0';
    }
  }
  cout << ans;
  return 0;
}
