#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 1e5 + 10;

int n, m, q;
int a[MAXN];

int main() {
	freopen("heoi2016_sort.in", "r", stdin);
	freopen("heoi2016_sort.out", "w", stdout);
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
	}
	for (int i = 1; i <= m; ++i) {
		int op, l, r;
		scanf("%d %d %d", &op, &l, &r);
		if (op == 0) {
			sort(a + l, a + r + 1, less <int>());
		} else {
			sort(a + l, a + r + 1, greater <int>());
		}
	}
	scanf("%d", &q);
	printf("%d\n", a[q]);
	return 0;
}