#include //#include //using namespace atcoder; #pragma GCC target ("avx") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") using namespace std; typedef vector VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef pair pii; typedef pair PLL; typedef pair TIII; typedef long long ll; typedef long double ld; typedef unsigned long long ull; #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define REP(i, n) FOR(i, 0, n) #define rep(i, a, b) for (int i = a; i < (b); ++i) #define trav(a, x) for (auto &a : x) #define all(x) x.begin(), x.end() #define MOD 1000000007 template inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;} template inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;} const double EPS = 1e-6, PI = acos(-1); const double pi = 3.141592653589793238462643383279; //ここから編集 typedef string::const_iterator State; ll GCD(ll a, ll b){ return (b==0)?a:GCD(b, a%b); } ll LCM(ll a, ll b){ return a/GCD(a, b) * b; } template< int mod > struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } }; using modint = ModInt< 1000000007 >; template< typename T > struct Combination { vector< T > _fact, _rfact, _inv; Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) { _fact[0] = _rfact[sz] = _inv[0] = 1; for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i; _rfact[sz] /= _fact[sz]; for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1); for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1]; } inline T fact(int k) const { return _fact[k]; } inline T rfact(int k) const { return _rfact[k]; } inline T inv(int k) const { return _inv[k]; } T P(int n, int r) const { if(r < 0 || n < r) return 0; return fact(n) * rfact(n - r); } T C(int p, int q) const { if(q < 0 || p < q) return 0; return fact(p) * rfact(q) * rfact(p - q); } T H(int n, int r) const { if(n < 0 || r < 0) return (0); return r == 0 ? 1 : C(n + r - 1, r); } }; int modpow(ll x, ll n, int mod) { ll res = 1; while(n) { if(n&1) res = res*x % mod; x = x*x%mod; n >>= 1; } return res; } template struct LazySegmentTree{ const int INF = numeric_limits::max(); int n0; vector node, lazy; LazySegmentTree(vector &v){ int n = v.size(); n0 = 1; while(n0 < n) n0 <<= 1; node.resize(2*n0-1); lazy.assign(2*n0-1, INF); for(int i=0; i=0; i--) node[i] = node[i*2+1] + node[i*2+2]; } void eval(int k, int p){ if(lazy[k] == INF) return; if(k < n0-1){ lazy[k*2+1] = lazy[k]; lazy[k*2+2] = lazy[k]; } node[k] = lazy[k] * p; lazy[k] = INF; } void update(int a, int b, T x, int k, ll l, ll r){ eval(k, r-l); if(a <= l && r <= b){ lazy[k] = x; eval(k, r-l); }else if(a < r && l < b) { update(a, b, x, k*2+1, l, (l+r)/2); update(a, b, x, k*2+2, (l+r)/2, r); node[k] = node[k*2+1] + node[k*2+2]; } } void update(int l, int r, T x) { update(l, r, x, 0, 0, n0); } T query(int a, int b, int k, ll l, ll r){ eval(k, r-l); if(r <= a || b <= l) return 0; 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 vl+vr; } } T query(int l, int r) { return query(l, r, 0, 0, n0); } inline T operator[](int a) { return query(a, a + 1); } }; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(7); int N; cin >> N; vector t(N); LazySegmentTree seg(t), seg2(t); int Q; cin >> Q; ll a = 0, b = 0; while(Q--) { int x, l, r; cin >> x >> l >> r; if(x == 0) { ll t = seg.query(l, r+1); ll t2 = seg2.query(l, r+1); if(t > t2) a += t; else if(t