#include <bits/stdc++.h>
using namespace std;
long long modpow(long long x, long long y, long long m) {
  long long z = 1;
  while (y) {
    if (y & 1) z = (z * x) % m;
    x = (x * x) % m;
    y >>= 1;
  }
  return z;
}
int egcd(int a, int b, int& x, int& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int gcd = egcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return gcd;
}
string z[2] = {"NO", "YES"};
long long mod = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int i, j, n, q, m;
  cin >> n >> q >> m;
  int a[q][3], b[m], ar[n];
  for (i = 0; i < n; ++i) cin >> ar[i];
  for (i = 0; i < q; ++i)
    for (j = 0; j < 3; ++j) cin >> a[i][j];
  for (i = 0; i < m; ++i) cin >> b[i];
  for (i = 0; i < m; ++i) {
    int cur = b[i] - 1;
    for (j = q - 1; j >= 0; --j) {
      if (!(cur + 1 >= a[j][1] && cur + 1 <= a[j][2])) continue;
      if (a[j][0] == 1) {
        if (cur == a[j][1] - 1)
          cur = a[j][2] - 1;
        else
          cur--;
        continue;
      } else
        cur = (a[j][2] - cur + a[j][1] - 2);
    }
    cout << ar[cur] << " ";
  }
  return 0;
}
