#include <bits/stdc++.h>
using namespace std;
const long long infl = 1e18 + 5;
long long int n, m, k, q, x, y, f, val, i, j;
long long int ind = -1, cnt, sz, sm, ans, mx = -1, mn = infl;
long long int a[1000004], t[1000004], l[1000004], r[1000004];
vector<long long int> v;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (fopen("inp.txt", "r")) {
    freopen("myfile.txt", "w", stdout);
    freopen("inp.txt", "r", stdin);
  }
  cin >> n >> q >> m;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 0; i < q; i++) {
    cin >> t[i] >> l[i] >> r[i];
  }
  for (i = 0; i < m; i++) {
    cin >> x;
    v.push_back(x);
  }
  for (i = q - 1; i >= 0; i--) {
    vector<long long int> v1;
    if (t[i] == 1) {
      for (j = 0; j < v.size(); j++) {
        if (v[j] < l[i] || v[j] > r[i]) {
          v1.push_back(v[j]);
        } else {
          if (v[j] == l[i])
            v1.push_back(r[i]);
          else
            v1.push_back(v[j] - 1);
        }
      }
    } else {
      for (j = 0; j < v.size(); j++) {
        if (v[j] < l[i] || v[j] > r[i]) {
          v1.push_back(v[j]);
        } else {
          v1.push_back(r[i] - v[j] + l[i]);
        }
      }
    }
    v.clear();
    v = v1;
  }
  for (i = 0; i < v.size(); i++) {
    cout << a[v[i] - 1] << " ";
  }
  return 0;
}
