#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, q, m, a[200005], b[105], c[105], d[200005], sz, q1[200005][3], t, r[105];
int main() {
  scanf("%d", &n);
  scanf("%d %d", &q, &m);
  for (__typeof(n) i = (1); i <= (n); i++) scanf("%d", &a[i]);
  for (__typeof(q) i = (1); i <= (q); i++)
    scanf("%d %d %d", &q1[i][0], &q1[i][1], &q1[i][2]);
  for (__typeof(m) i = (1); i <= (m); i++) {
    scanf("%d", &t);
    d[t] = 1;
    b[i] = t;
  }
  for (__typeof(n) i = (1); i <= (n); i++)
    if (d[i] > 0) {
      c[++sz] = i;
      r[sz] = c[sz];
    }
  for (__typeof(1) i = (q); i >= (1); i--) {
    if (q1[i][0] == 1) {
      for (int j = 1; j <= sz; j++) {
        if (r[j] >= q1[i][1] && r[j] <= q1[i][2]) {
          r[j]--;
          if (r[j] < q1[i][1]) r[j] = q1[i][2];
        }
      }
    } else {
      int l1, r1;
      for (int j = 1; j <= sz; j++) {
        if (r[j] >= q1[i][1] && r[j] <= q1[i][2]) {
          int mid = (q1[i][1] + q1[i][2]) / 2;
          if (r[j] <= mid) {
            l1 = r[j] - q1[i][1];
            r[j] = q1[i][2] - l1;
          } else {
            l1 = q1[i][2] - r[j];
            r[j] = q1[i][1] + l1;
          }
        }
      }
    }
  }
  for (__typeof(m) i = (1); i <= (m); i++)
    for (__typeof(sz) j = (1); j <= (sz); j++)
      if (b[i] == c[j]) {
        cout << a[r[j]] << " ";
        break;
      }
  return 0;
}
