#include <bits/stdc++.h>
using namespace std;
int A[200007];
vector<pair<int, pair<int, int> > > v;
int cur[107];
int main() {
  int i, j, k, l, m, n, x, y, z, a, b, r, q;
  scanf("%d", &n);
  scanf("%d", &q);
  scanf("%d", &m);
  for (i = 1; i <= n; i++) scanf("%d", &A[i]);
  while (q--) {
    scanf("%d", &b);
    scanf("%d", &l);
    scanf("%d", &r);
    v.push_back(make_pair(b, make_pair(l, r)));
  }
  for (i = 1; i <= m; i++) {
    scanf("%d", &cur[i]);
  }
  for (x = (int)v.size() - 1; x >= 0; x--) {
    b = v[x].first;
    l = v[x].second.first;
    r = v[x].second.second;
    if (b == 1) {
      for (i = 1; i <= m; i++)
        if (cur[i] == l)
          cur[i] = r;
        else if (cur[i] >= l && cur[i] <= r)
          (cur[i])--;
    } else {
      for (i = 1; i <= m; i++)
        if (l <= cur[i] && cur[i] <= r) cur[i] = r - (cur[i] - l);
    }
  }
  for (i = 1; i <= m; i++) printf("%d ", A[cur[i]]);
  printf("\n");
  return 0;
}
