Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:

* update(s, t, x): change as, as+1, ..., at to x.
* find(i): output the value of ai.



Note that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.

Constraints

* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
* 0 ≤ s ≤ t < n
* 0 ≤ i < n
* 0 ≤ x < 231−1

Input


n q
query1
query2
:
queryq


In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:


0 s t x


or


1 i


The first digit represents the type of the query. '0' denotes update(s, t, x) and '1' denotes find(i).

Output

For each find operation, print the value.

Examples

Input

3 5
0 0 1 1
0 1 2 3
0 2 2 2
1 0
1 1


Output

1
3


Input

1 3
1 0
0 0 0 5
1 0


Output

2147483647
5
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long

#define pa pair<int,int>
#define int long long

using namespace std;

int inf=(1ll<<40);
struct seg_rangeupd_getpoint{
	//       1
	//   2        3
	// 4   5   6    7
	
	
	private:
	public:
	
	// (1<<15)=32768
	// 1<<16 = 65536
	// 1<<17 = 131072
	// 1<<18 = 262144
	
	int cor=(1<<17);
	
	vector<int> vec;
	void shoki1(){
		vec.resize(2*cor+3, inf);
	}
	void shoki2(){
		vec[1]=(1ll<<31)-1;
		//初期値
	}
		
	void chien(int k,int l,int r){
		if(l+1<r)if(vec[k]!=inf){
			vec[2*k]=vec[k];
			vec[2*k+1]=vec[k];
			vec[k]=inf;
		}
	}
	
	void rangeupd(int a,int b,int w, int k=1,int l=0,int r=-3){
		//[a,b)を wに変更
		if(r<0) r=cor;
		if(a<=l && r<=b){
			vec[k]=w;
			return ;
		}
		if(r<=a || b<=l){
			return ;
		}
		chien(k,l,r);
//	cout<<k<<" "<<l<<" "<<r<<endl;
		rangeupd(a,b,w,k*2,l,(l+r)/2);
		rangeupd(a,b,w,k*2+1,(l+r)/2,r);
		return ;
	}
	
	// [a,b)
	// k-th node
	// k no kukanha [l,r)
	int getpoint(int x){
		x+=cor;
		int ans=0;
		while(1){
			if(x==0) break;
			if(vec[x]!=inf) ans=vec[x];
			x/=2;
		}
		
		return ans;
		
	}
	
	void pre(){
		for(int i=1;i<2*cor;i++){
			cout<<vec[i]<<" ";
			if(((i+1)&(-(i+1)))==i+1) cout<<endl;
		}
	}
	
};

//[a,b)にxを一様加算 rangeadd(a,b,x)
//[a,b)の和 getsum(a,b)

signed main(){
seg_rangeupd_getpoint SE;
	
	SE.shoki1();
//	for(int i=0;i<SE.cor;i++){
//		SE.vec[i+SE.cor]=i;
//	}
	SE.shoki2();
	
	
	int n,q;
	cin>>n>>q;
	
	for(int i=0;i<q;i++){
	int d,a,b,c;
		cin>>a;
		
		if(a==0){
			cin>>b>>c>>d;
			
			SE.rangeupd(b,c+1,d);
		}
		else{
			cin>>b;
			
			cout<<SE.getpoint(b)<<endl;
		}
		//SE.pre();
	}
	return 0;
}



