#include #include using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using tp = tuple; template using vec = vector; template using vvec = vector>; #define all(hoge) (hoge).begin(), (hoge).end() #define en '\n' #define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i) #define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i) #define REP(i, n) rep(i, 0, n) #define REP2(i, n) rep2(i, 0, n) constexpr long long INF = 1LL << 60; constexpr int INF_INT = 1 << 25; constexpr long long MOD = (ll)1e9 + 7; //constexpr long long MOD = 998244353LL; static const ld pi = 3.141592653589793L; #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") template inline bool chmin(T &a, T b) { if(a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if(a < b) { a = b; return true; } return false; } //グラフ関連 struct Edge { int to, rev; ll cap; Edge(int _to, ll _cap, int _rev) : to(_to), cap(_cap), rev(_rev) {} }; typedef vector Edges; typedef vector Graph; void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) { G[from].push_back(Edge(to, cap, (int)G[to].size())); if(revFlag) G[to].push_back(Edge(from, revCap, (int)G[from].size() - 1)); } struct S { int num; int sum; }; struct F { int num; int sum; }; S op(S l, S r) { return S{l.num + r.num, l.sum + r.sum}; } S e() { return S{0, 0}; } S mapping(F l, S r) { if(l.num == 1 and l.sum == 0) return r; return S{l.num, l.sum}; } F composition(F l, F r) { if(l.num == 1 and l.sum == 0) return r; return F{l.num, l.sum}; } F id() { return F{1, 0}; } ll k = 0; bool g(S a) { return a.num <= k; } void solve() { int n, q; cin >> n >> q; vec a(n); REP(i, n) { cin >> a[i]; } lazy_segtree seg(vec(n + 2, S{1, 0})); REP(i, n) { seg.apply(i, F{1, a[i]}); } REP(i, q) { int t, l, r; cin >> t >> l >> r; l--; k = l; int l2 = seg.max_right(0); k = r; int r2 = seg.max_right(0); if(t == 2) { cout << seg.prod(l2, r2).sum << endl; } else { int sum = seg.prod(l2, r2).sum; seg.apply(l2, l2 + 1, F{1, sum}); seg.apply(l2 + 1, r2, F{0, 0}); } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); // ll t; // cin >> t; // REP(i, t - 1) { // solve(); // } solve(); return 0; }