#include <bits/stdc++.h>
using namespace std;
mt19937 gen(chrono::system_clock::now().time_since_epoch().count());
const int N = 2e5 + 10;
const long long MOD = 1e9 + 7;
const int rx[4] = {-1, 0, 1, 0};
const int ry[4] = {0, 1, 0, -1};
const long double eps = 1e-7;
const long double pi = acos(-1.0);
const int INF = 2e9;
vector<int> g[N];
vector<int> e;
bool used[N];
int d[N], l[N], n;
void dfs(int v, int deep) {
  d[v] = deep;
  used[v] = true;
  e.push_back(v);
  if (deep + 1 >= n) {
    l[v] = e[deep + 1 - n];
  } else
    l[v] = -INF;
  for (auto to : g[v]) {
    if (!used[to]) dfs(to, deep + 1);
  }
  e.pop_back();
}
struct segtree {
  vector<int> t;
  int nw;
  segtree(int n) {
    nw = (1 << (32 - __builtin_clz(n) - (__builtin_popcount(n) == 1)));
    t.resize(nw << 1, -INF);
  }
  void modify(int v, int cl, int cr, int pos, int val) {
    if (cr - cl == 1) {
      t[v] = val;
      return;
    }
    int mid = (cl + cr) / 2;
    if (pos < mid)
      modify(v * 2, cl, mid, pos, val);
    else
      modify(v * 2 + 1, mid, cr, pos, val);
    t[v] = max(t[v * 2], t[v * 2 + 1]);
  }
  void modify(int pos, int val) { modify(1, 1, nw + 1, pos + 1, val + 1); }
  int mn(int v, int cl, int cr, int l, int r) {
    if (cl >= l && cr <= r) {
      return t[v];
    }
    if (cl >= r || cr <= l) return -INF;
    int mid = (cl + cr) / 2;
    return max(mn(v * 2, cl, mid, l, r), mn(v * 2 + 1, mid, cr, l, r));
  }
  int mn(int l, int r) { return mn(1, 1, nw + 1, l, r + 1); }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int m, q;
  cin >> n >> m >> q;
  int p[n];
  for (int i = 0; i < n; i++) cin >> p[i];
  int b[m];
  for (int i = 0; i < m; i++) cin >> b[i];
  int pr[n + 1];
  vector<int> pos(n + 1, -1);
  pr[p[0]] = p[n - 1];
  for (int i = 1; i < n; i++) {
    pr[p[i]] = p[i - 1];
  }
  for (int i = 0; i < m; i++) {
    if (pos[pr[b[i]]] == -1) {
      pos[b[i]] = i;
      continue;
    }
    g[pos[pr[b[i]]]].push_back(i);
    g[i].push_back(pos[pr[b[i]]]);
    pos[b[i]] = i;
  }
  segtree ts(m);
  for (int i = 0; i < m; i++) {
    if (!used[i]) {
      dfs(i, 0);
    }
    ts.modify(i, l[i]);
  }
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    int x = ts.mn(l, r);
    if (x >= l && x <= r)
      cout << "1";
    else
      cout << "0";
  }
  return 0;
}
