#include <bits/stdc++.h>
using namespace std;
struct Q {
  int t, l, r;
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, q, m;
  cin >> n >> q >> m;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<Q> qry;
  for (int i = 0; i < q; i++) {
    int t, l, r;
    cin >> t >> l >> r;
    qry.push_back({t, l, r});
  }
  reverse(qry.begin(), qry.end());
  auto rev = [&](int &i, int t, int l, int r) {
    if (i >= l and i <= r) {
      i = t == 2 ? r - (i - l) : (i == l ? r : i - 1);
    }
  };
  for (int i = 0; i < m; i++) {
    int id;
    cin >> id;
    for (auto [t, l, r] : qry) {
      rev(id, t, l, r);
    }
    cout << a[id - 1] << endl;
  }
}
