#include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 10;
const int M = 1000000007;
const double PI = atan(1) * 4;
const int oo = 1000000000;
int n, q, m, v[N];
vector<pair<int, pair<int, int> > > que;
int main() {
  cin >> n >> q >> m;
  for (int i = 0; i < n; ++i) scanf("%d", &v[i]);
  for (int a, b, c, i = 0; i < q; ++i) {
    scanf("%d%d%d", &a, &b, &c);
    que.push_back(make_pair(a - 1, pair<int, int>(b - 1, c - 1)));
  }
  reverse((que).begin(), (que).end());
  for (int x, i = 0; i < m; ++i) {
    scanf("%d", &x);
    --x;
    for (int i = 0; i < q; ++i) {
      int t = que[i].first, l = que[i].second.first, r = que[i].second.second;
      if (x > r || x < l) continue;
      if (!t) {
        if (x == l)
          x = r;
        else
          --x;
      } else
        x = r - (x - l);
    }
    printf("%d ", v[x]);
  }
}
