#include <bits/stdc++.h>
using namespace std;
bool is_prime(int n) {
  for (int i = 2; i <= sqrt(n); i++) {
    if (!(n % i)) return false;
  }
  return true;
}
void solve(int index = 0) {
  int n, q, m;
  cin >> n >> q >> m;
  vector<int> v(n);
  for (auto &c : v) cin >> c;
  vector<pair<int, pair<int, int>>> queries(q);
  for (auto &c : queries) {
    int x, y, z;
    cin >> x >> y >> z;
    y--;
    z--;
    c = make_pair(x, make_pair(y, z));
  }
  vector<int> b(m);
  for (auto &c : b) {
    cin >> c;
    c--;
  }
  for (int i = 0; i < m; i++) {
    int index = b[i];
    for (int j = q - 1; j >= 0; j--) {
      auto pp = queries[j];
      int x = pp.first;
      int l = pp.second.first;
      int r = pp.second.second;
      if (index >= l && index <= r) {
        if (x == 1) {
          if (index == l) {
            index = r;
          } else {
            index--;
          }
        } else {
          index = l + r - index;
        }
      }
    }
    cout << v[index] << " ";
  }
  cout << "\n";
}
void multi_solve() {
  int t;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
