#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int a[N], t[N], l[N], r[N], b[N];
int n, q, m;
int main() {
  cin >> n >> q >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < q; i++) cin >> t[i] >> l[i] >> r[i];
  for (int i = 0; i < m; i++) {
    cin >> b[i];
    int x = b[i];
    for (int j = q - 1; j >= 0; j--) {
      if (x >= l[j] && x <= r[j]) {
        if (t[j] == 1) {
          x = x - 1;
          if (x < l[j]) x = r[j];
        } else if (t[j] == 2) {
          x = r[j] - x + l[j];
        }
      }
    }
    if (i != 0) cout << ' ';
    cout << a[x];
  }
  return 0;
}
