Problem:
Range Update Query (RUQ)

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.

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.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 100000

0 ≤ s ≤ t < n

0 ≤ i < n

0 ≤ x < 231−1

Sample Input 1

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

Sample Output 1

1
3

Sample Input 2

1 3
1 0
0 0 0 5
1 0

Sample Output 2

2147483647
5

Solution in C++14 (judge verdict: Accepted)

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

template <typename Monoid>
class LazySegmentTree{
  public:
    using T = typename Monoid::value_type;
    using E = typename Monoid::lazy_type;
    int n;
    T identity;
    E lazy_def;
    vector<T> val;
    vector<E> lazy;

    LazySegmentTree(){}
    LazySegmentTree(int n_, vector<T> v=vector<T>()){
      identity = Monoid::identity;
      lazy_def = Monoid::lazy_def;
      n = 1;
      while(n < n_)n *= 2;
      val.assign(2*n-1, identity);
      lazy.assign(2*n-1, lazy_def);

      for(size_t i = 0; i < v.size(); i++){
        val[i+n-1] = v[i];
      }
      for(int i = n - 2; i >= 0; i--){
        val[i] = Monoid::operation(val[2*i+1], val[2*i+2]);
      }
    }
    void eval(int k, int len){
      if(lazy[k] == lazy_def)return;
      if(k < n - 1){
        lazy[2*k+1] = Monoid::lazy_accumulate(lazy[2*k+1], lazy[k]);
        lazy[2*k+2] = Monoid::lazy_accumulate(lazy[2*k+2], lazy[k]);
      }
      val[k] = Monoid::lazy_update(val[k], lazy[k], len);
      lazy[k] = lazy_def;
    }
    T update(int a,int b, E &e, int k, int l, int r){
      eval(k, r - l);
      if(r <= a || b <= l)return val[k];
      else if(a <= l && r <= b){
        lazy[k] = Monoid::lazy_accumulate(lazy[k], e);
        eval(k, r - l);
        return val[k];
      }else{
        T lv = update(a, b, e, 2*k+1, l, (l+r)/2);
        T rv = update(a, b, e, 2*k+2, (l+r)/2, r);
        return val[k] = Monoid::operation(lv, rv);
      }
    }
    T update(int a, int b, E e){
      return update(a, b, e, 0, 0, n);
    }
    T query(int a, int b, int k, int l, int r){
      eval(k, r - l);
      if(r <= a || b <= l)return identity;
      if(a <= l && r <= b)return val[k];
      T lv = query(a, b, 2*k+1, l, (l+r)/2);
      T rv = query(a, b, 2*k+2, (l+r)/2, r);
      return Monoid::operation(lv, rv);
    }
    T query(int a, int b){
      return query(a, b, 0, 0, n);
    }
    T get(int i){
      return query(i, i + 1);
    }
};

template <typename T, typename E>
class RUQ{
  public:
    using value_type = T;
    using lazy_type = E;
    const static T identity = 0;
    const static E lazy_def = numeric_limits<E>::min();
    RUQ(){}
    static T operation(T &l, T &r){
      return l + r;
    }
    static E lazy_accumulate(E &l, E &r){
      return r;
    }
    static T lazy_update(T &t, E &e, int len){
      return e * len;
    }
};


int main(int argc, char const* argv[])
{
  int n, q; cin >> n >> q;
  LazySegmentTree<RUQ<ll, ll>> seg(n, vector<ll>(n, INT_MAX));
  rep(i_, q){
    int c; cin >> c;
    if(c == 0){
      int s, t; cin >> s >> t;
      ll x; cin >> x;
      seg.update(s, t + 1, x);
    }else{
      int i; cin >> i;
      cout << seg.get(i) << endl;
    }
  }
  return 0;
}