#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn], l[maxn], r[maxn], t[maxn];
int main() {
  int n, q, m;
  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", &t[i], &l[i], &r[i]);
  while (m--) {
    int cnt;
    scanf("%d", &cnt);
    for (int i = q; i > 0; i--) {
      if (l[i] <= cnt && r[i] >= cnt)
        if (t[i] == 1) {
          cnt--;
          if (cnt < l[i]) cnt = r[i];
        } else {
          cnt = l[i] + r[i] - cnt;
        }
    }
    printf("%d ", a[cnt]);
  }
  return 0;
}
