#include <bits/stdc++.h>
using namespace std;
int dadsadasda;
const int INF = 0x3f3f3f3f;
const long long INFLL = 1e18 + 1;
const int MOD = 998244353;
const int MAXN = 5e3 + 1;
struct query {
  int t, l, r;
};
bool belong(query &q, int pos) { return q.l <= pos && pos <= q.r; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, q, m;
  cin >> n >> q >> m;
  int a[n + 1];
  for (int i = 1; i < n + 1; i++) cin >> a[i];
  query tim[q + 1];
  for (int i = 1; i < q + 1; i++) cin >> tim[i].t >> tim[i].l >> tim[i].r;
  int b[m];
  for (int i = 0; i < m; i++) cin >> b[i];
  for (int i = q; i > 0; i--) {
    for (int j = 0; j < m; j++)
      if (belong(tim[i], b[j])) {
        if (tim[i].t == 1) {
          if (b[j] == tim[i].l)
            b[j] = tim[i].r;
          else
            b[j]--;
        } else {
          int disInit = b[j] - tim[i].l;
          b[j] = tim[i].r - disInit;
        }
      }
  }
  for (int i = 0; i < m - 1; i++) cout << a[b[i]] << " ";
  cout << a[b[m - 1]] << '\n';
  return 0;
}
