#include <bits/stdc++.h>
using namespace std;
int a[200005];
struct query {
  int t, l, r;
} q[200005];
int main() {
  int n, qq, m, x;
  while (cin >> n >> qq >> m) {
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int i = 0; i < qq; i++) {
      scanf("%d%d%d", &q[i].t, &q[i].l, &q[i].r);
    }
    for (int i = 0; i < m; i++) {
      scanf("%d", &x);
      for (int j = qq - 1; j >= 0; j--) {
        if (x >= q[j].l && x <= q[j].r) {
          x = q[j].r - (x - q[j].l);
          if (q[j].t == 1) {
            if (x != q[j].r) x = q[j].r - 1 - (x - q[j].l);
          }
        }
      }
      printf("%d%c", a[x], i == m - 1 ? '\n' : ' ');
    }
  }
  return 0;
}
