#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
 
const ll INF=(1ll<<31)-1;
int a[100001];
int b[1005];
int main(){
    int n,q;
    cin>>n>>q;
    int sqn=sqrt(n);
    int bn=(n+sqn-1)/sqn;
    rep(i,n) a[i]=INF;
    rep(i,bn) b[i]=INF;
    int com;
    rep(i,q){
        cin>>com;
        if(com==0){
            int s,t,x;
            //[s,t)
            cin>>s>>t>>x;
            ++t;
            rep(j,bn){
                int l=j*sqn,r=(j+1)*sqn;
                if(r<=s||t<=l) continue;
                if(s<=l&&r<=t) b[j]=x;
                else{
                    FOR(k,l,r){
                        if(k>=max(s,l)&&k<min(t,r)) a[k]=x;
                        else if(b[j]!=INF) a[k]=b[j];
                    }
                    b[j]=INF;
                }
            }
        }
        if(com==1){
            int k;
            cin>>k;
            int cur=k/sqn;
            if(b[cur]!=INF){
                FOR(j,cur*sqn,(cur+1)*sqn){
                    a[j]=b[cur];
                }
                b[cur]=INF;
            }
            cout<<a[k]<<endl;
        }
    }
    return 0;
}
