#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
template <class T>
inline bool readint(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-1') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
inline void outint(int x) {
  if (x > 9) outint(x / 10);
  putchar(x % 10 + '0');
}
int a[maxn];
struct Node {
  int t, l, r;
} node[maxn];
int n, q, m;
int fun(int cur) {
  for (int i = q; i; i--) {
    if (cur >= node[i].l && cur <= node[i].r) {
      if (node[i].t == 1) {
        if (cur == node[i].l)
          cur = node[i].r;
        else
          cur--;
      }
      if (node[i].t == 2) {
        cur = node[i].r - cur + node[i].l;
      }
    }
  }
  return a[cur];
}
int main() {
  while (scanf("%d%d%d", &n, &q, &m) != EOF) {
    for (int i = 1; i <= n; i++) readint(a[i]);
    for (int i = 1; i <= q; i++) {
      readint(node[i].t);
      readint(node[i].l);
      readint(node[i].r);
    }
    for (int i = 1; i <= m; i++) {
      int x;
      readint(x);
      if (i != 1) putchar(' ');
      printf("%d", fun(x));
    }
    puts("");
  }
  return 0;
}
