#include<bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + ;

int n , m , q;

int a[MAXN],b[MAXN];

struct Que

{

        int op , l , r;

} que[MAXN];

struct Node

{

        int l , r;

        int tag , cnt;

} Tree[MAXN << ];

template <typename T> inline void chkmax(T &x,T y) { x = max(x,y); }

template <typename T> inline void chkmin(T &x,T y) { x = min(x,y); }

template <typename T> inline void read(T &x)

{

    T f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

inline void update(int index)

{

        Tree[index].cnt = Tree[index << ].cnt + Tree[index <<  | ].cnt;

}

inline void build(int index,int l,int r)

{

        Tree[index].l = l;

        Tree[index].r = r;

        Tree[index].tag = -;

        if (l == r)

        {

                Tree[index].cnt = b[l];

                return;

        }

        int mid = (l + r) >> ;

        build(index << ,l,mid);

        build(index <<  | ,mid + ,r);

        update(index);

}

inline void pushdown(int index)

{

        int l = Tree[index].l , r = Tree[index].r ,

                mid = (l + r) >> ;

        if (Tree[index].tag != -)

        {

                if (Tree[index].tag)

                {

                        Tree[index << ].cnt = mid - l + ;

                        Tree[index <<  | ].cnt = r - mid;

                        Tree[index << ].tag = Tree[index <<  | ].tag = ;

                } else

                {

                        Tree[index << ].cnt = Tree[index <<  | ].cnt = ;

                        Tree[index << ].tag = Tree[index <<  | ].tag = ;

                }

                Tree[index].tag = -;

        }

}

inline void modify(int index,int l,int r,int value)

{

        if (l > r) return;

        if (Tree[index].l == l && Tree[index].r == r)

        {

                if (value == ) Tree[index].cnt = Tree[index].r - Tree[index].l + ;

                else Tree[index].cnt = ;

                Tree[index].tag = value;

                return;

        }

        pushdown(index);

        int mid = (Tree[index].l + Tree[index].r) >> ;

        if (mid >= r) modify(index << ,l,r,value);

        else if (mid +  <= l) modify(index <<  | ,l,r,value);

        else

        {

                modify(index << ,l,mid,value);

                modify(index <<  | ,mid + ,r,value);

        }

        update(index);

}

inline int query(int index,int l,int r)

{

        if (Tree[index].l == l && Tree[index].r == r) return Tree[index].cnt;

        pushdown(index);

        int mid = (Tree[index].l + Tree[index].r) >> ;

        if (mid >= r) return query(index << ,l,r);

        else if (mid +  <= l) return query(index <<  | ,l,r);

        else return query(index << ,l,mid) + query(index <<  | ,mid + ,r);

}

inline bool check(int x)

{

        for (int i = ; i <= n; i++) b[i] = (a[i] <= x);

        build(,,n);

        for (int i = ; i <= m; i++)

        {

                if (que[i].op == )

                {

                        int cnt = query(,que[i].l,que[i].r);

                        modify(,que[i].l,que[i].l + cnt - ,);

                        modify(,que[i].l + cnt,que[i].r,);

                } else

                {

                        int cnt = query(,que[i].l,que[i].r);

                        modify(,que[i].l,que[i].r - cnt,);

                        modify(,que[i].r - cnt + ,que[i].r,);

                }

        }

        return query(,q,q) == ;

}

int main()

{

        read(n); read(m);

        for (int i = ; i <= n; i++) read(a[i]);

        for (int i = ; i <= m; i++)

        {

                read(que[i].op);

                read(que[i].l);

                read(que[i].r);

        }

        read(q);

        int l =  , r = n , ans;

        while (l <= r)

        {

                int mid = (l + r) >> ;

                if (check(mid))

                {

                        ans = mid;

                        r = mid - ;

                } else l = mid + ;

        }

        printf("%d\n",ans);

        return ;

}