#include <bits/stdc++.h>
using namespace std;
int T[200000];
struct Q {
  int t, l, r;
  Q(int a, int b, int c) : t(a), l(b), r(c) {}
};
void perform(const Q& q, vector<int>& v) {
  for (int& i : v) {
    if (i < q.l || i > q.r) continue;
    if (q.t == 1)
      i = i == q.l ? q.r : i - 1;
    else
      i = q.l + q.r - i;
  }
}
void solve() {
  int n, q, m, t, l, r;
  cin >> n >> q >> m;
  for (int i = 0; i < (int)(n); ++i) cin >> T[i];
  stack<Q> first;
  while (q--) {
    cin >> t >> l >> r;
    first.emplace(t, l, r);
  }
  vector<int> B(m);
  for (int i = 0; i < (int)(m); ++i) cin >> B[i];
  while (!first.empty()) {
    perform(first.top(), B);
    first.pop();
  }
  for (int i : B) cout << T[i - 1] << ' ';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
