#include<bits/stdc++.h>
using namespace std;
int n, m, q, a[100010];
bool cmp2(int x, int y) {
	return x > y;
}
signed 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, x, y;
		scanf("%d%d%d", &op, &x, &y);
		if(op == 1) {
			sort(a + x, a + y + 1, cmp2);
		}
		else {
			sort(a + x, a + y + 1);
		}
	}
	scanf("%d", &q);
	printf("%d", a[q]);
	return 0;
}