#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 11;
int n, m, q;
int arr[MAXN];
int qs[MAXN][3];
int main() {
  scanf("%d%d%d", &n, &q, &m);
  for (int i = 0; i < n; ++i) scanf("%d", arr + i);
  for (int i = q - 1; i >= 0; --i) {
    scanf("%d%d%d", &qs[i][0], &qs[i][1], &qs[i][2]);
    --qs[i][1], --qs[i][2];
  }
  for (int i = 0; i < m; ++i) {
    int b;
    scanf("%d", &b), --b;
    for (int j = 0; j < q; ++j) {
      if (!(qs[j][1] <= b && b <= qs[j][2])) continue;
      if (qs[j][0] == 1) {
        if (b == qs[j][1])
          b = qs[j][2];
        else
          --b;
      } else {
        b = qs[j][1] + (qs[j][2] - b);
      }
    }
    printf("%d ", arr[b]);
  }
  return 0;
}
