#include <bits/stdc++.h>
using namespace std;
int n, q, m, b;
int a[200005], t[200005], l[200005], r[200005];
int ans[105];
int main() {
  scanf("%d %d %d", &n, &q, &m);
  for (int ii = 1; ii <= n; ii++) scanf("%d", &a[ii]);
  for (int ii = 0; ii < q; ii++) scanf("%d %d %d", &t[ii], &l[ii], &r[ii]);
  for (int ii = 0; ii < m; ii++) {
    scanf("%d", &b);
    int pos = b;
    for (int jj = q - 1; jj >= 0; jj--) {
      if (pos >= l[jj] && pos <= r[jj]) {
        if (t[jj] == 1) {
          pos--;
          if (pos < l[jj]) pos = r[jj];
        } else {
          pos = l[jj] + ((r[jj] - l[jj] + 1) - (pos - l[jj] + 1) + 1) - 1;
        }
      }
    }
    ans[ii] = a[pos];
  }
  for (int ii = 0; ii < m; ii++)
    printf("%d%c", ans[ii], (ii < n - 1) ? ' ' : '\n');
}
