#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

//const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


template <typename T> class LazySegmentTree {
private:
    const int array_size;
    int n;
    std::vector<T> node, lazy;
    std::function<T (T,T)> op;
    T unit;

public:
    enum Mode {
        RangeMinimumQuery,
        RangeMaximumQuery,
        RangeSummationQuery,
    };

    LazySegmentTree(const std::vector<LL> &v, Mode mode) : array_size(v.size()) {
        if (mode == RangeMinimumQuery) {
            unit = INT_MAX;
            op = [](T a, T b) { return std::min(a, b); };
        }
        else if (mode == RangeMaximumQuery) {
            unit = -INT_MAX;
            op = [](T a, T b) { return std::max(a, b); };
        }
        else if (mode == RangeSummationQuery) {
            unit = 0;
            op = [](T a, T b) { return a + b; };
        }
        else {
            assert(false);
        }

        n = 1;
        while (n < array_size) { n *= 2; }
        node.resize(2 * n - 1, unit);
        lazy.resize(2 * n - 1, -1);

        for (int i = 0; i < array_size; ++i) {
            node[i + n - 1] = v[i];
        }
        for (int i = n - 2; i >= 0; i--) {
            node[i] = op(node[i * 2 + 1], node[i * 2 + 2]);
        }
    }

    // array[idx]
    // log(N)
    T access(int idx) {
        return query(idx, idx + 1, 0, 0, n);
    }

    // array[idx] = x
    // log(N)
    void update(int idx, T x) {
        update(idx, idx + 1, x);
    }

    // array[left, right) = x
    // log(N)
    void update(int left, int right, T x) {
        assert(0 <= left and left < right and right <= array_size);
        update(left, right, x, 0, 0, n);
    }

    // op(array[a, b))
    // log(N)
    T query(int left, int right) {
        return query(left, right, 0, 0, n);
    }

private:
    T update(const int a, const int b, const LL x, const int k, const int l, const int r) {
        eval(k, l, r);

        // 範囲外
        if (r <= a or b <= l) {
            return node[k];
        }
        // 完全に含む
        else if (a <= l and r <= b) {
            lazy[k] = x;
            eval(k, l, r);
            return node[k];
        }
        // 一部含む
        else {
            T vl = update(a, b, x, 2 * k + 1, l, (l + r) / 2);    // 左の子
            T vr = update(a, b, x, 2 * k + 2, (l + r) / 2, r);    // 右の子
            return node[k] = op(vl, vr);
        }
    }

    // [a, b)の目的値をノードk（区間[l, r]）から検索
    T query(int a, int b, int k, int l, int r) {
        eval(k, l, r);

        // 範囲外
        if (b <= l or r <= a) {
            return unit;
        }
        // 完全に含む
        else if (a <= l && r <= b) {
            return node[k];
        }
        // 一部含む
        else {
            T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);    // 左の子
            T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);    // 右の子
            return op(vl, vr);
        }
    }

    void eval(int k, int l, int r) {
        if (lazy[k] == -1) {
            return;
        }

        node[k] = lazy[k];
        if (r - l > 1) {
            lazy[2 * k + 1] = lazy[k];
            lazy[2 * k + 2] = lazy[k];
        }
        lazy[k] = -1;
    }
};

using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, Q;
    cin >> N >> Q;

    vector<LL> v(N, 2147483647);

    LazySegmentTree<LL> lst(v, LazySegmentTree<LL>::Mode::RangeMinimumQuery);

    FOR(_, 0, Q) {
        int query, s, t, x, i;
        cin >> query;
        if (query == 0) {
            cin >> s >> t >> x;
            lst.update(s, t + 1, x);
        }
        else {
            cin >> i;
            print(lst.access(i));
        }
    }

    return 0;
}


Measured memory_bytes: 7952