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

using ull = unsigned long long;
using ll = long long;

#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x) ll x; cin >> x;

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int) (lower_bound(s, t, x) - s)
#define UB(s, t, x) (int) (upper_bound(s, t, x) - s)

ll qp(ll a, ll b, int mo) { ll ans = 1; do { if (b & 1) ans = 1ll * ans * a % mo; a = 1ll * a * a % mo; } while (b >>= 1); return ans; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll temp = gcd(a, b); return temp ? (a / temp * b) : 0; }
int mDays[] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = { 1, -1, 0, 0, 1, 1, -1, -1 }, dy8[] = { 0, 0, -1, 1, -1, 1, -1, 1 };

template <typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) { return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...)); }
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v) { for (auto &e : t) fill_v(e, v); }
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);

const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);

template <typename T>
vector<T> pows(int b, int n) {
    vector<T> ret;
    T x = 1;
    while (ret.size() < n) {
        ret.push_back(x);
        x *= b;
    }
    return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string& str, const std::string& from, const std::string& to) {
	std::string::size_type pos = 0;
	while (pos = str.find(from, pos), pos != std::string::npos) {
		str.replace(pos, from.length(), to);
		pos += to.length();
	}
}
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 (b < a) { a = b; return 1; } return 0; }

inline tuple<ll, ll> rotate45(tuple<ll, ll> point) { ll x = get<0>(point), y = get<1>(point); return tuple<ll, ll>(x + y, x - y); }
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) { return nx >= 0 and nx < Width and ny >= 0 and ny < Height; }

template <typename T>
vector<T> INPA(ll n) {
	vector<T> x;
	REP(i, n) {
		T tmp; cin >> tmp;
		x.push_back(tmp);
	}
	return move(x);
}
template <typename T>
void out(T o) { cout << o << endl; }
template <typename T>
void out(vector<T> &out) { REP(i, (int)out.size()) { cout << out[i]; if (i == (int)out.size() - 1) cout << endl; else cout << " "; } }
template <typename T>
void out(vector<vector<T>> o) { REP(i, o.size()) out(o[i]); }
void YesNo(bool f) { cout << (f?"Yes":"No") << endl; }
void YESNO(bool f) { cout << (f?"YES":"NO") << endl; }

// use " for (const auto& e : V)

string longestCommonPrefix(vector<string>& strs) {
    int n = INT_MAX;
    if (strs.size() <= 0) {
        return "";
    }
    if (strs.size() == 1) {
        return strs[0];
    }
    // get the min length
    for (int i = 0; i < strs.size(); i ++) {
        n = strs[i].length() < n ? strs[i].length() : n ;
    }
    for (int i = 0; i < n; i ++) { // check each character
        for (int j = 1; j < strs.size(); j ++) {
            if (strs[j][i] != strs[j - 1][i]) { // we find a mis-match
                return strs[0].substr(0, i);
            }
        }
    }
    // prefix is n-length
    return strs[0].substr(0, n);
}

namespace PrimeLib {
	//* 素数判定 is_prime<unsigned>(N)
	template<typename T, std::enable_if_t<std::is_unsigned<T>::value, std::nullptr_t> = nullptr>
	bool is_prime(const T n) {
		if (n < 4) return n == 2 || n == 3;
		if (n % 2 == 0 || n % 3 == 0 || (n % 6 != 1 && n % 6 != 5)) return false;
		for (T i = 5; i * i <= n; i += 6) if (n % i == 0 || n % (i + 2) == 0) return false;
		return true;
	}
	//* 素数テーブル生成　エラトステネスの篩 10^7 => 1s
	//* 1e9を素因数分解したい時，sqrt(1e9)まで(31623程)を生成すればよい
	vector<ll> primeTable(ll n) {
		vector<bool> table(n - 1);
		vector<ll> ret;
		for (ll i = 0; i < n - 1; ++i) {
			if (table[i] == false) {
				ll num = i + 2;
				ret.push_back(i + 2);
				for (int j = i + num; j < n - 1; j += num)
					table[j] = true;	
			}
		}
		return ret;
	}
	vector<ll> factorize(ll n, vector<ll> &pt) {
		vector<ll> ret;
		int pos = 0;
		ll c = n;
		while (c != 1) {
			ll p = pt[pos];
			ret.push_back(0);
			while (c % p == 0) {
				ret[pos]++;
				c /= p;
			}
			pos++; if (pos >= pt.size()) break;
		}
		//assert(c == 1);
		// if c is still not 1, 
		// there's one prime num bigger than sqrt(N)
		if (c != 1 ) ret.push_back(1);
		return ret;
	}
}

ll p_base(ll base, ll x) {
	ll ans = 1;
	REP(i, x) {
		ans *= base;
		ans %= MOD_CONST;
	}
	return ans;
}

class ListG {
public:
	vector<vector<int>> to;

	ListG(int s) : root(-1) {
		size = s;
		to = make_v<vector<int>>(size);
	}

	void addDirectedEdge(int f, int t) {
		to[f].push_back(t);
	}
	void addIndirectedEdge(int v1, int v2) {
		addDirectedEdge(v1, v2);
		addDirectedEdge(v2, v1);
	}

	void dfs(int x) {
		// do something
	}

	void makeTree(int r) {
		root = r;
		p = make_v<int>(size);
		p[root] = -1;
		mtdfs(root);
		auto idxs = make_v<int>(size);
		iota(all(idxs), 0);
		leaf_idx = set<int>(all(idxs));
		FOR(i, 1, size)
			leaf_idx.erase(p[i]);
	}

	void makeEulerTour() {
		assert(root >= 0);
		et_begin = make_v<int>(size);
		et_end = make_v<int>(size);
		tmp_k = 0;
		etdfs(root, -1);
	}

	int size, root;
	vector<int> p; // parent for each node. parent of root = -1
	vector<int> euler_tour;
	vector<int> et_begin, et_end;
	set<int> leaf_idx;

	int tmp_k;
private:	
	void mtdfs(int c) {
		REP(i, to[c].size()) {
			int next = to[c][i];
			if (p[c] == next) continue;
			p[next] = c;
			mtdfs(next);
		}
	}
	void etdfs(int vidx, int pidx) {
		et_begin[vidx] = tmp_k;
		euler_tour.push_back(vidx);
		tmp_k++;
		REP(i, to[vidx].size()) {
			if (to[vidx][i] != pidx) {
				etdfs(to[vidx][i], vidx);
				euler_tour.push_back(vidx);
				tmp_k++;
			}
		}
		et_end[vidx] = tmp_k;
	}
};


// range add and minimum query
// verified by http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_H
class SegmentTree_RMAQ {
public:
	int size;
	vector<ll> minimum, lazy;
	
	SegmentTree_RMAQ(int s, ll initial_value = 0ll) {
		size = 1;
		while (size < s)
			size <<= 1;
		minimum = make_v<ll>(2 * size);
		fill_v(minimum, initial_value);
		lazy = make_v<ll>(2 * size);
		fill_v(lazy, initial_value);
	}

	// add value to minimum[l, r)
	void update(int l, int r, ll addValue) {
		update(l, r, 0, 0, size, addValue);
	}

	// [l, r) , include v[l], not include v[r]
	ll query(int l, int r) {
		return query(l, r, 0, 0, size);
	}
private:
	ll query(int l, int r, int k, int lc, int rc) {
		lazy_eval(k);
		if (rc <= l or r <= lc)
			return INT64_MAX;
		else if (l <= lc and rc <= r) {
			return minimum[k];
		} else {
			int lcidx = k * 2 + 1, pidx = (lc + rc) / 2;
			return min(
				query(l, r, lcidx, lc, pidx),
				query(l, r, lcidx + 1, pidx, rc)
			);
		}
	}

	void lazy_eval(int k) {
		ll lk = lazy[k];
		minimum[k] += lk;
		if (k < size - 1) {
			int lcidx = 2 * k + 1;
			lazy[lcidx] += lk;
			lazy[lcidx + 1] += lk;
		}
		lazy[k] = 0;
	}
	void update(int l, int r, int k, int lc, int rc, ll addValue) {
		if (rc <= l or r <= lc)
			return;
		else if (l <= lc and rc <= r) {
			lazy[k] += addValue;
			lazy_eval(k);
		} else {
			lazy_eval(k);
			int lcidx = k * 2 + 1, pidx = (lc + rc) / 2;
			update(l, r, lcidx, lc, pidx, addValue);
			update(l, r, lcidx + 1, pidx, rc, addValue);
			if (lazy[lcidx] != 0) lazy_eval(lcidx);
			if (lazy[lcidx+1] != 0) lazy_eval(lcidx+1);
			minimum[k] = min(minimum[lcidx], minimum[lcidx + 1]);
		}
	}
};

int main(void)
{
    cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20);

	IN1(N);
    SegmentTree_RMAQ rmq(N);
//	ll av[8] = {3, 12, 7, 4, 9, 8, 13, 5};
//	REP(i, N) rmq.update(i, i + 1, av[i]);
	IN1(Q);
    REP(i, Q) {
        IN1(C); IN1(x); IN1(y);
        if (C == 0) {
			IN1(V);
            rmq.update(x, y+1, V);
        } else {
            ll ans = rmq.query(x, y+1);
            out(ans);
        }
    }

	return 0;
}


Measured memory_bytes: 7052