#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, q, m;
  cin >> n >> q >> m;
  vector<int> b(n + 1), a(m + 1);
  for (int i = 1; i <= n; i++) cin >> b[i];
  int t[q], l[q], r[q];
  for (int i = 0; i < q; i++) cin >> t[i] >> l[i] >> r[i];
  for (int i = 1; i <= m; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= m; i++) {
    for (int j = q - 1; j >= 0; j--) {
      if (l[j] > a[i] || r[j] < a[i]) continue;
      if (t[j] & 1) {
        if (a[i] == l[j]) {
          a[i] = r[j];
        } else {
          --a[i];
        }
      } else {
        a[i] = r[j] + l[j] - a[i];
      }
    }
  }
  for (int i = 1; i <= m; i++) {
    cout << b[a[i]] << " ";
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  while (t--) {
    solve();
  }
}
