// Slower C++ solution:
#include <cstdio>

#include <vector>

#include <algorithm>

using namespace std;



// Abstract Lazy Segment Tree (抽象・汎化遅延セグメント木)

// Verified: AOJ のセグ木 verify 問全部



const int SIZE = 1 << 17; // 2^17 = 131072

template<typename T>

struct lazysegtree {

    // ノード、単位元

    T node[2*SIZE], lazy[2*SIZE], I_upd, I_qry;

    bool need_upd[2*SIZE];



    // オペレーション (update, query の 2 つが必要？)

    // update function は範囲を指定する形にしよう

    // upd_f(X, Y, l, r) -> 範囲が [l, r) であるようなノード X に Y を反映！

    // lazy について update するときは範囲を 1 にしないとバグります

    T (*upd_f)(T, T, int, int), (*qry_f)(T, T);



    // 演算子と単位元をセットし、全ての node と lazy を単位元で初期化

    lazysegtree(T (*op1)(T, T, int, int), T (*op2)(T, T), T X_upd, T X_qry) {

        upd_f = op1; qry_f = op2;

        I_upd = X_upd, I_qry = X_qry;

        fill(lazy, lazy+2*SIZE, I_upd);

        fill(node, node+2*SIZE, I_qry);

        fill(need_upd, need_upd+2*SIZE, false);

    }



    // 配列 vec の値で初期化

    void init(vector<T> vec) {

        int N = (int)vec.size();

        for(int i=0; i<N; i++) {

            node[SIZE-1+i] = vec[i];

        }

        for(int i=SIZE-2; i>=0; i--) {

            node[i] = qry_f(node[2*i+1], node[2*i+2]);

        }

    }



    void lazy_eval(int k, int l, int r) {

        if(!need_upd[k]) return;

        node[k] = upd_f(node[k], lazy[k], l, r);

        if(r - l > 1) {

            lazy[2*k+1] = upd_f(lazy[2*k+1], lazy[k], 0, 1);

            lazy[2*k+2] = upd_f(lazy[2*k+2], lazy[k], 0, 1);

            need_upd[2*k+1] = need_upd[2*k+2] = true;

        }

        lazy[k] = I_upd;

        need_upd[k] = false;

    }



    // 半開区間 [a, b) に対して値 val を反映させる

    // (upd_f を用いて処理)

    void update(int a, int b, T val, int l=0, int r=SIZE, int k=0) {

        lazy_eval(k, l, r);

        if(b <= l || r <= a) return;

        if(a <= l && r <= b) {

            lazy[k] = upd_f(lazy[k], val, 0, 1);

            need_upd[k] = true;

            lazy_eval(k, l, r);

        }

        else {

            int mid = (l + r) / 2;

            update(a, b, val, l, mid, 2*k+1);

            update(a, b, val, mid, r, 2*k+2);

            node[k] = qry_f(node[2*k+1], node[2*k+2]);

        }

    }



    // 半開区間 [a, b) に対してクエリを投げる

    // (qry_f を用いて処理)

    T query(int a, int b, int l=0, int r=SIZE, int k=0) {

        lazy_eval(k, l, r);

        if(b <= l || r <= a) return I_qry;

        if(a <= l && r <= b) return node[k];

        int mid = (l + r) / 2;

        T vl = query(a, b, l, mid, 2*k+1);

        T vr = query(a, b, mid, r, 2*k+2);

        return qry_f(vl, vr);

    }

};



// [[つかいかた]]

// update 用と query 用の関数と単位元 (関数を噛ませても結果が変わらないもの) を用意して宣言する

// 下の例だと、update 用の関数が upd で、query 用の関数が fnd で、単位元が 0



typedef long long int ll;

const ll INF = 1LL << 60;

// 範囲が [l, r) のノードの値 a に値 b を反映させる

ll upd(ll a, ll b, int l, int r) {return a + b;}

// ノードの値 a と b に対してどのような操作をするか？

ll fnd(ll a, ll b) {return min(a, b);}

lazysegtree<ll> seg(upd, fnd, 0, INF);



int main() {

    int N, Q; scanf("%d%d", &N, &Q);

    seg.init(vector<ll>(N, 0));

    for(int i=0; i<Q; i++) {

        int query; scanf("%d", &query);

        if(query == 0) {

            int s, t, x; scanf("%d%d%d", &s, &t, &x);

            seg.update(s, t+1, x);

        }

        if(query == 1) {

            int s, t; scanf("%d%d", &s, &t);

            printf("%lld\n", seg.query(s, t+1));

        }

    }

}


// Faster C++ solution for the same problem (measured speedup: 5.74717064369419x):
#include <iostream>

#include <cstdio>

#include <algorithm>

#include <climits>

#include <functional>

using namespace std;



// 動的遅延セグメント木 (必要なところだけノードを作る)



template <typename MonoidType, typename OperatorType>

struct LazySegNode {

    MonoidType value;

    OperatorType lazy_value;

    bool need_update;

    LazySegNode *ch[2];

    

    LazySegNode() {}

    LazySegNode(MonoidType value_, OperatorType lazy_value_) :

        value(value_), lazy_value(lazy_value_) {

        need_update = false;

        ch[0] = ch[1] = nullptr;

    }

};



template <typename MonoidType, typename OperatorType, typename IdxType = int>

struct DynamicLazySegmentTree {

    using MMtoM = function< MonoidType(MonoidType, MonoidType) >;

    using OOtoO = function< OperatorType(OperatorType, OperatorType) >;

    using MOtoM = function< MonoidType(MonoidType, OperatorType) >;

    using OItoO = function< OperatorType(OperatorType, int) >;

    using LNode = LazySegNode<MonoidType, OperatorType>;



    // node, identity element

    IdxType n;

    LNode *root;

    MonoidType E0;

    OperatorType E1;



    // update / combine / lazy / accumulate function

    MOtoM upd_f;

    MMtoM cmb_f;

    OOtoO lzy_f;

    OItoO acc_f;



    DynamicLazySegmentTree() {}

    DynamicLazySegmentTree(IdxType n_, MonoidType E0_, OperatorType E1_,

                           MOtoM upd_f_, MMtoM cmb_f_, OOtoO lzy_f_, OItoO acc_f_) :

        E0(E0_), E1(E1_),

        upd_f(upd_f_), cmb_f(cmb_f_), lzy_f(lzy_f_), acc_f(acc_f_) {

        root = new LNode(E0_, E1_);

        n = 1; while(n < n_) n *= 2;

    }



    void eval(LNode *node, IdxType l, IdxType r) {

        if(!node->need_update) return;

        node->value = upd_f(node->value, acc_f(node->lazy_value, r - l));

        if(r - l > 1) {

            if(!node->ch[0]) node->ch[0] = new LNode(E0, E1);

            if(!node->ch[1]) node->ch[1] = new LNode(E0, E1);

            node->ch[0]->lazy_value = lzy_f(node->ch[0]->lazy_value, node->lazy_value);

            node->ch[1]->lazy_value = lzy_f(node->ch[1]->lazy_value, node->lazy_value);

            node->ch[0]->need_update = node->ch[1]->need_update = true;

        }

        node->lazy_value = E1;

        node->need_update = false;

    }



    void update(LNode *node, IdxType a, IdxType b, OperatorType x,

                IdxType l, IdxType r) {

        eval(node, l, r);

        if(b <= l or r <= a) return;

        if(a <= l and r <= b) {

            node->lazy_value = lzy_f(node->lazy_value, x);

            node->need_update = true;

            eval(node, l, r);

        }

        else {

            IdxType mid = (l + r) / 2;

            if(!node->ch[0]) node->ch[0] = new LNode(E0, E1);

            if(!node->ch[1]) node->ch[1] = new LNode(E0, E1);

            update(node->ch[0], a, b, x, l, mid);

            update(node->ch[1], a, b, x, mid, r);

            node->value = cmb_f(node->ch[0]->value, node->ch[1]->value);

        }

    }



    MonoidType query(LNode *node, IdxType a, IdxType b, IdxType l, IdxType r) {

        if(b <= l or r <= a) return E0;

        eval(node, l, r);

        if(a <= l and r <= b) return node->value;

        IdxType mid = (l + r) / 2;

        MonoidType vl = (node->ch[0] ? query(node->ch[0], a, b, l, mid) : E0);

        MonoidType vr = (node->ch[1] ? query(node->ch[1], a, b, mid, r) : E0);

        return cmb_f(vl, vr);

    }



    // update [a, b)-th element (applied value: x)

    void update(IdxType a, IdxType b, OperatorType x) {

        update(root, a, b, x, 0, n);

    }



    // range query for [a, b)

    MonoidType query(IdxType a, IdxType b) {

        return query(root, a, b, 0, n);

    }

};





void DSL_2_D() {

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

    DynamicLazySegmentTree<int, int> seg(N, INT_MAX, INT_MAX,

                                         [](int a, int b) { return b; },

                                         [](int a, int b) { return min(a, b); },

                                         [](int a, int b) { return b; },

                                         [](int a, int b) { return a; });



    int indexed = 0;

    for(int i=0; i<Q; i++) {

        int q; cin >> q;

        if(q == 0) {

            int s, t, x; cin >> s >> t >> x;

            s -= indexed; t -= indexed; t++;

            seg.update(s, t, x);

        }

        if(q == 1) {

            int k; cin >> k;

            k -= indexed;

            cout << seg.query(k, k+1) << endl;

        }

    }

}



// Verified on Apr 27, 2019

void DSL_2_E() {

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

    DynamicLazySegmentTree<int, int> seg(N, 0, 0,

                                         [](int a, int b) { return a + b; },  // upd

                                         [](int a, int b) { return a + b; },  // cmb

                                         [](int a, int b) { return a + b; },  // lzy

                                         [](int a, int x) { return a * x; }); // acc

    

    int indexed = 1;

    for(int i=0; i<Q; i++) {

        int query_type; cin >> query_type;

        if(query_type == 0) {

            int s, t, x; cin >> s >> t >> x; t++;

            s -= indexed, t -= indexed;

            seg.update(s, t, x);

        }

        if(query_type == 1) {

            int s; cin >> s;

            s -= indexed;

            cout << seg.query(s, s+1) << endl;

        }

        // seg.dump();

    }    

}



// Verified on Apr 27, 2019

void DSL_2_F() {

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

    DynamicLazySegmentTree<int, int> seg(N, INT_MAX, 0,

                                         [](int a, int b) { return b;         },  // upd

                                         [](int a, int b) { return min(a, b); },  // cmb

                                         [](int a, int b) { return b;         },  // lzy

                                         [](int a, int x) { return a;         }); // acc

    

    int indexed = 0;

    for(int i=0; i<Q; i++) {

        int query_type; cin >> query_type;

        if(query_type == 0) {

            int s, t, x; cin >> s >> t >> x; t++;

            s -= indexed, t -= indexed;

            seg.update(s, t, x);

        }

        if(query_type == 1) {

            int s, t; cin >> s >> t; t++;

            s -= indexed; t -= indexed;

            cout << seg.query(s, t) << endl;

        }

        // seg.dump();

    }    

}



// Verified on Apr 27, 2019

void DSL_2_G() {

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

    using ll = long long int;

    DynamicLazySegmentTree<ll, ll> seg(N, 0, 0,

                                       [](ll a, ll  b) { return a + b; },  // upd

                                       [](ll a, ll  b) { return a + b; },  // cmb

                                       [](ll a, ll  b) { return a + b; },  // lzy

                                       [](ll a, int x) { return a * x; }); // acc

    

    int indexed = 1;

    for(int i=0; i<Q; i++) {

        int query_type; cin >> query_type;

        if(query_type == 0) {

            int s, t, x; cin >> s >> t >> x; t++;

            s -= indexed, t -= indexed;

            seg.update(s, t, x);

        }

        if(query_type == 1) {

            int s, t; cin >> s >> t; t++;

            s -= indexed; t -= indexed;

            cout << seg.query(s, t) << endl;

        }

        // seg.dump();

    }    

}



// Verified on Apr 27, 2019

void DSL_2_H() {

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

    using ll = long long int;

    using Pair = pair<ll, ll>;

    DynamicLazySegmentTree<ll, Pair> seg(N, INT_MAX, make_pair(0, 0),

                                       [](ll a, Pair b) {

                                             if(b.second == 1) {

                                                 return b.first;

                                             }

                                             else {

                                                 return a + b.first;

                                             }

                                         },  // upd

                                       [](ll a, ll  b) { return min(a, b); },  // cmb

                                       [](Pair a, Pair b) {

                                           if(a.second == 0 and b.second == 0) {

                                               return make_pair(a.first + b.first, 0LL);

                                           }

                                           if(a.second == 0 and b.second == 1) {

                                               return b;

                                           }

                                           if(a.second == 1 and b.second == 0) {

                                               return make_pair(a.first + b.first, 1LL);

                                           }

                                           if(a.second == 1 and b.second == 1) {

                                               return b;

                                           }

                                       },

                                       [](Pair a, int x) { return a;         }); // acc

    

    int indexed = 0;

    for(int i=0; i<N; i++) {

        seg.update(i, i+1, make_pair(0, 1));

    }

    for(int i=0; i<Q; i++) {

        int query_type; cin >> query_type;

        if(query_type == 0) {

            int s, t, x; cin >> s >> t >> x; t++;

            s -= indexed, t -= indexed;

            seg.update(s, t, make_pair(x, 0));

        }

        if(query_type == 1) {

            int s, t; cin >> s >> t; t++;

            s -= indexed; t -= indexed;

            cout << seg.query(s, t) << endl;

        }

        // seg.dump();

    }    

}



// Verified on Apr 27, 2019

void DSL_2_I() {

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

    using ll = long long int;

    DynamicLazySegmentTree<ll, ll> seg(N, 0, 0,

                                       [](ll a, ll  b) { return b;     },  // upd

                                       [](ll a, ll  b) { return a + b; },  // cmb

                                       [](ll a, ll  b) { return b;     },  // lzy

                                       [](ll a, int x) { return a * x; }); // acc

    

    int indexed = 0;

    for(int i=0; i<Q; i++) {

        int query_type; cin >> query_type;

        if(query_type == 0) {

            int s, t, x; cin >> s >> t >> x; t++;

            s -= indexed, t -= indexed;

            seg.update(s, t, x);

        }

        if(query_type == 1) {

            int s, t; cin >> s >> t; t++;

            s -= indexed; t -= indexed;

            cout << seg.query(s, t) << endl;

        }

        // seg.dump();

    }    

}



int main() {

    // DSL_2_D();

    // DSL_2_E();

    // DSL_2_F();

    // DSL_2_G();

    DSL_2_H();

    // DSL_2_I();

    return 0;

}