#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-8;
const long double pi = acos(-1.0);
struct SegT {
 private:
  int sz;
  vector<int> node;
  const int init_c = mod;

 public:
  SegT(vector<int> c) {
    int n = c.size();
    sz = 1;
    while (sz < n) sz *= 2;
    node.resize(2 * sz - 1, init_c);
    for (int i = 0; i < n; i++) {
      node[sz - 1 + i] = c[i];
    }
    for (int i = sz - 1 - 1; i >= 0; i--) {
      node[i] = f(node[2 * i + 1], node[2 * i + 2]);
    }
  }
  int f(int a, int b) { return min(a, b); }
  void update(int k, int a) {
    k += sz - 1;
    node[k] = a;
    while (k > 0) {
      k = (k - 1) / 2;
      node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
    }
  }
  int query(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = sz;
    if (r <= a || b <= l)
      return init_c;
    else if (a <= l && r <= b)
      return node[k];
    else {
      int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
      int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
      return f(vl, vr);
    }
  }
};
int par[1 << 18][18];
vector<int> loc[1 << 18];
void solve() {
  int n, m, q;
  cin >> n >> m >> q;
  vector<int> p(n), invp(n);
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    p[i]--;
    invp[p[i]] = i;
  }
  vector<int> a(m);
  for (int i = 0; i < m; i++) {
    cin >> a[i];
    a[i]--;
    loc[a[i]].push_back(i);
  }
  for (int i = 0; i < n; i++) loc[i].push_back(m);
  for (int i = 0; i < m; i++) {
    int z = invp[a[i]];
    z++;
    if (z == n) z = 0;
    z = p[z];
    int id = upper_bound(loc[z].begin(), loc[z].end(), i) - loc[z].begin();
    par[i][0] = loc[z][id];
  }
  for (int i = 0; i < 18; i++) par[m][i] = m;
  for (int i = 1; i <= 17; i++) {
    for (int j = 0; j < m; j++) {
      par[j][i] = par[par[j][i - 1]][i - 1];
    }
  }
  vector<int> v;
  for (int i = 0; i < 18; i++) {
    if ((n - 1) & (1 << i)) {
      v.push_back(i);
    }
  }
  vector<int> ri(m);
  for (int i = 0; i < m; i++) {
    int cur = i;
    for (int j = 0; j < v.size(); j++) {
      cur = par[cur][v[j]];
    }
    ri[i] = cur;
  }
  SegT st(ri);
  string ans;
  for (int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    l--;
    r--;
    int u = st.query(l, r + 1);
    if (r < u)
      ans.push_back('0');
    else
      ans.push_back('1');
  }
  cout << ans << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
