//#include <bits/stdc++.h>
 
#include <iostream>
#include <algorithm>
 
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
 
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
 
 
using namespace std;
#define int long long
 
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
 
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
 
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
 
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
 
//debug
#define DEBUG 
 
#define DUMPOUT cout
 
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...) 
#endif
 
void dump_func() {DUMPOUT << endl;};
 
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
 
//ostream 
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}
 
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n, q, a, b;
int x[200000 + 5];
int sum;

//(i = 0, 1, ..., q)
//    (j = 1, 2, ..., n)
//dp[i+1][j] = dp[i][j] + |xi+1-xi| (xiを動かす)(全区間更新O[1])
//dp[i+1][xi] = min(dp[i+1][xi], dp[i][j] + |xi+1-j|) (xiを固定)(一点更新&全区間最小値取得O[logn])
    //dpl[j] = dp[i][j] - j;
    //dpr[j] = dp[i][j] + j;
//とおくと
//dp[i][j] + |xi+1-j| = dpl + xi+1(j < xi+1)
//                      dpr - xi+1(xi+1 <= j)

struct segtree {
    int size;
    vector<long long> node, lazy;

    segtree (int n) : size(1) {
        while (size < n) size *= 2;
        node.resize(2 * size - 1, 0);
        lazy.resize(2 * size - 1, 0);
    }


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

    int add_range(int L, int R, int x, int k, int nodeL, int nodeR) {
        eval_push(nodeL, nodeR, k);
        if (nodeR <= L || R <= nodeL) return node[k];
        if (L <= nodeL && nodeR <= R) {
            lazy[k] += x;
            eval_push(nodeL, nodeR, k);
            return node[k];
        }
        int nodeM = (nodeL + nodeR) / 2;
        int vl = add_range(L, R, x, 2 * k + 1, nodeL, nodeM);
        int vr = add_range(L, R, x, 2 * k + 2, nodeM, nodeR);
        return node[k] = min(vl, vr);
    }
    void add_range(int L, int R, int x) {
        add_range(L, R, x, 0, 0, size);
    } 

    //[queryL: queryR)
    long long get(int queryL, int queryR, int k, int nodeL, int nodeR) {
        eval_push(nodeL, nodeR, k);
        if (nodeR <= queryL || queryR <= nodeL) return INFLL / 2;
        if (queryL <= nodeL && nodeR <= queryR) {
            eval_push(nodeL, nodeR, k);
            return node[k];
        }
        int nodeM = (nodeL + nodeR) / 2;
        long long vl = get(queryL, queryR, 2 * k + 1, nodeL, nodeM);
        long long vr = get(queryL, queryR, 2 * k + 2, nodeM, nodeR);
        return min(vl, vr);
    }
    long long get(int queryL, int queryR) {
        return get(queryL, queryR, 0, 0, size);
    }
};

signed main() {	
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> q;
    segtree seg(n);
    rep(i, q) {
        int query;
        cin >> query;
        if (query == 0) {
            int s, t, x;
            cin >> s >> t >> x;
            seg.add_range(s, t + 1, x);
        }
        else {
            int s, t;
            cin >> s >> t;
            cout << seg.get(s, t + 1) << endl;
        }
    }
}



Measured memory_bytes: 7088