#include <bits/stdc++.h>
using namespace std;
int n, q, m;
int a[200020];
struct node {
  int type, l, r;
} query[200020];
vector<int> uni, dup;
int siz;
void rev(int st, int en) {
  int i;
  for (i = 0; i < uni.size(); i++) {
    int ele = uni[i];
    if (ele >= st && ele <= en) {
      int diff = ele - st;
      uni[i] = en - diff;
    }
  }
}
void cyc(int st, int en) {
  int i;
  for (i = 0; i < uni.size(); i++) {
    int ele = uni[i];
    if (ele >= st && ele <= en) {
      if (ele == st)
        uni[i] = en;
      else
        uni[i] = uni[i] - 1;
    }
  }
}
int toanswer[200020];
int main() {
  int i, j, t;
  scanf("%d%d%d", &n, &q, &m);
  ;
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (i = 1; i <= q; i++) {
    int st, en, type;
    scanf("%d%d%d", &type, &st, &en);
    ;
    query[i].type = type;
    query[i].l = st;
    query[i].r = en;
  }
  for (i = 1; i <= m; i++) {
    int chu;
    scanf("%d", &chu);
    toanswer[i] = chu;
    uni.push_back(chu);
  }
  sort(uni.begin(), uni.end());
  uni.erase(unique(uni.begin(), uni.end()), uni.end());
  for (i = 0; i < uni.size(); i++) {
    dup.push_back(uni[i]);
  }
  for (i = q; i >= 1; i--) {
    if (query[i].type == 2) {
      rev(query[i].l, query[i].r);
    } else {
      cyc(query[i].l, query[i].r);
    }
  }
  map<int, int> answer;
  for (i = 0; i < uni.size(); i++) {
    answer[dup[i]] = uni[i];
  }
  for (i = 1; i <= m; i++) {
    printf("%d ", a[answer[toanswer[i]]]);
  }
  cout << endl;
  return 0;
}
