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 "bits/stdc++.h"
using namespace std;

typedef long long ll;

#define INF (1<<20)
const int MAX_N = 1 << 18;

typedef pair<int,int> P;

int n;
P dat[2*MAX_N-1];

void init(int _n) {
	n = 1;
	while(n < _n) n *= 2;
	for (int i = 0; i < 2 * n - 1; i++) {
		dat[i].first = -1;
		dat[i].second = INT_MAX;
	}
}

int find(int k) {
	k += n-1;
	P p = dat[k];

	while (k > 0) {
		k = (k-1)/2;
		p = max(p, dat[k]);
	}

	return p.second;
}

void update(int a, int b, int k, P p, int l, int r) {
	if (r <= a || b <= l) return;
	
	if (a <= l && r <= b) {
		dat[k] = p;
	}
	else {
		update(a,b,k*2+1,p,l,(l+r)/2);
		update(a,b,k*2+2,p,(l+r)/2,r);
	}
}

int main() {
	int _n, q;
	cin >> _n >> q;
	init(_n);

	for (int i = 0; i < q; i++) {
		int j; cin >> j;
		if (j) {
			int u;
			cin >> u;
			cout << find(u) << endl;
		}
		else {
			int s, t, x;
			cin >> s >> t >> x;
			update(s,t+1,0,P(i,x),0,n);
		}
	}

}
