#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int a[200000 + 10];
int b[105];
int n, q, m;
pair<pair<int, int>, int> sav[200000 + 10];
void dfs(int now, int NW) {
  NW--;
  for (int i = NW; i >= 1; --i) {
    int ty, li, ri;
    ty = sav[i].first.first;
    li = sav[i].first.second;
    ri = sav[i].second;
    if (now <= ri && now >= li) {
      if (ty == 1) {
        int nex = now - 1;
        if (nex == li - 1) {
          nex = ri;
        }
        dfs(nex, i);
      } else {
        int from_l = now - li + 1;
        int nex = ri - from_l + 1;
        dfs(nex, i);
      }
      return;
    }
  }
  printf("%d ", a[now]);
}
int main() {
  scanf("%d %d %d", &n, &q, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 1; i <= q; ++i) {
    scanf("%d %d %d", &sav[i].first.first, &sav[i].first.second,
          &sav[i].second);
  }
  for (int i = 1; i <= m; ++i) scanf("%d", &b[i]);
  for (int i = 1; i <= m; ++i) {
    dfs(b[i], q + 1);
  }
  return 0;
}
