#include <bits/stdc++.h>
using namespace std;
mt19937_64 rd(time(0));
template <typename T>
T gcd(T a, T b) {
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <typename T>
T max(T a, T b, T c, T d) {
  return max(a, max(b, c, d));
}
template <typename T>
T i_rand(T l, T r) {
  assert(l <= r);
  return uniform_int_distribution<T>(l, r)(rd);
}
template <typename T>
T r_rand(T l, T r) {
  return uniform_real_distribution<T>(l, r)(rd);
}
template <typename T>
void sfe(T a[], int l, int r) {
  shuffle(a + l, a + 1 + r, rd);
}
template <typename T>
void sfe(vector<T> a) {
  shuffle(a.begin(), a.end(), rd);
}
struct Q {
  int l, r;
  int t;
};
int n, q, m;
long long a[200001];
Q qu[200001];
signed main() {
  clock_t _, __;
  _ = clock();
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> q >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= q; ++i) cin >> qu[i].t >> qu[i].l >> qu[i].r;
  for (int i = 1; i <= m; ++i) {
    int b;
    cin >> b;
    for (int j = q; j >= 1; --j) {
      int t = qu[j].t;
      int l = qu[j].l;
      int r = qu[j].r;
      if (b < l || b > r) continue;
      if (t == 1) {
        --b;
        if (b < l) b = r;
      }
      if (t == 2) b = r - b + l;
    }
    cout << a[b] << ' ';
  }
  __ = clock();
  double ___ = double(__ - _) / (double)CLOCKS_PER_SEC;
  cerr << "\nTime executed: " << setprecision(5) << fixed << ___ << " sec\n";
  return 0;
}
