#include <bits/stdc++.h>
using namespace std;
const int CMAX = 200010;
const long long MOD = 1e9 + 7;
const double eps = 1e-7;
const long long linf = LLONG_MAX;
const int inf = INT_MAX;
const double PI = 3.14159265;
int N, M;
int a[CMAX];
vector<tuple<int, int, int> > queries;
vector<int> ms, ans;
int ll1(int a, int l, int r) { return (a == l ? r : a - 1); }
int rev(int a, int l, int r) { return l + r - a; }
int main() {
  int n, q, m;
  cin >> n >> q >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < q; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    queries.push_back({x, y, z});
  }
  for (int i = 0; i < m; i++) {
    int x;
    cin >> x;
    ms.push_back(x);
  }
  reverse(queries.begin(), queries.end());
  for (int i : ms) {
    for (tuple<int, int, int> q : queries) {
      int type = get<0>(q);
      int l = get<1>(q);
      int r = get<2>(q);
      if (l <= i && i <= r) {
        if (type == 1)
          i = ll1(i, l, r);
        else
          i = rev(i, l, r);
      }
    }
    ans.push_back(i);
  }
  for (int i : ans) cout << a[i] << " ";
  return 0;
}
