#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
const int mod=1e9+7;
inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}
int n,m,q,ans;
int a[maxn];
struct Question{
    int typ,l,r;
}b[maxn];
int id[maxn];
struct SegmentTree{
    #define mid ((l+r)>>1)
    #define lson rt<<1,l,mid
    #define rson rt<<1|1,mid+1,r
    int siz[maxn<<2],tag[maxn<<2];
    inline void push_up(int rt){
        siz[rt]=siz[rt<<1]+siz[rt<<1|1];
    }
    void build(int rt,int l,int r,int k){
        siz[rt]=0,tag[rt]=-1;
        if(l==r){
            id[l]=rt;
            if(a[l]>=k) siz[rt]=1;
            return;
        }
        build(lson,k),build(rson,k);
        push_up(rt);
    }
    inline void push_down(int rt,int l,int r){
        if(!tag[rt]){
            tag[rt<<1]=tag[rt<<1|1]=tag[rt];
            siz[rt<<1]=siz[rt<<1|1]=0;
            tag[rt]=-1;
        }
        if(tag[rt]==1){
            tag[rt<<1]=tag[rt<<1|1]=tag[rt];
            siz[rt<<1]=mid-l+1,siz[rt<<1|1]=r-mid;
            tag[rt]=-1;
        }
    }
    void update(int rt,int l,int r,int pl,int pr,int k){
        if(pl<=l&&r<=pr){
            if(!k) siz[rt]=0,tag[rt]=0;
            else siz[rt]=r-l+1,tag[rt]=1;
            return;
        }
        push_down(rt,l,r);
        if(pl<=mid) update(lson,pl,pr,k);
        if(pr>mid) update(rson,pl,pr,k);
        push_up(rt);
    }
    int query(int rt,int l,int r,int pl,int pr){
        if(pl<=l&&r<=pr) return siz[rt];
        push_down(rt,l,r);
        int res=0;
        if(pl<=mid) res+=query(lson,pl,pr);
        if(pr>mid) res+=query(rson,pl,pr);
        return res;
    }
    inline void output1(){ 
        for(int i=1;i<=n;++i){
            printf("%d %d %d\n",i,siz[id[i]],tag[id[i]]);
        }
    }
    inline void output2(int rt,int l,int r){
        printf("%d %d %d %d %d\n",rt,l,r,siz[rt],tag[rt]);
        if(l==r) return;
        output2(lson),output2(rson);
    }
    #undef mid
}S;
inline bool check(int x){
    S.build(1,1,n,x);
    //printf("%d\n",x);
    //S.output1();
    for(int i=1;i<=m;++i){
        int num0,num1;
        num1=S.query(1,1,n,b[i].l,b[i].r);
        num0=(b[i].r-b[i].l+1)-num1;
        //printf("%d %d\n",num0,num1);
        if(!b[i].typ){
            if(num0) S.update(1,1,n,b[i].l,b[i].l+num0-1,0);
            if(num1) S.update(1,1,n,b[i].r-num1+1,b[i].r,1);
        }
        else{
            if(num1) S.update(1,1,n,b[i].l,b[i].l+num1-1,1);
            if(num0) S.update(1,1,n,b[i].r-num0+1,b[i].r,0);
        }
        //S.output2(1,1,n);
    }
    return S.query(1,1,n,q,q);
}
int main(){
    n=read(),m=read();
    for(int i=1;i<=n;++i) a[i]=read();
    for(int i=1;i<=m;++i){
        b[i].typ=read(),b[i].l=read(),b[i].r=read();
    }
    q=read();
    int l=1,r=n;
    while(l<=r){
        int mid=(l+r)>>1;
        if(check(mid)) ans=mid,l=mid+1;
        else r=mid-1;
    }
    printf("%d\n",ans);
    return 0;
}