#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 2e5 + 10;
int n, q, m;
int ar[N];
pair<int, pii> quer[N];
int solve(int id) {
  for (int i = q; i >= 1; i--) {
    int tipe = quer[i].first;
    int l = quer[i].second.first;
    int r = quer[i].second.second;
    if (id < l || r < id) continue;
    if (tipe == 1) {
      if (id == l)
        id = r;
      else
        id--;
    } else {
      int range = r - l + 1;
      id = range - (id - l) + (l - 1);
    }
  }
  return ar[id];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q >> m;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  for (int i = 1; i <= q; i++) {
    cin >> quer[i].first >> quer[i].second.first >> quer[i].second.second;
  }
  while (m--) {
    int b;
    cin >> b;
    cout << solve(b) << " ";
  }
  cout << '\n';
  return 0;
}
