#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vll = vector<ll>;
using vll2 = vector<vector<ll>>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr ll MOD = 1e9 + 7;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
struct T {
    ll ev, od, sum;
};
inline T f(T a, T b) {
    T res = a;
    res.ev += b.ev;
    res.od += b.od;
    res.sum += b.sum;
    return res;
}
inline T ga(T a, int k) {
    if (k) {
        a.sum = a.od;
    }
    return a;
}
inline T gb(T a, ll x, ll lo) {
    a.sum += x * lo;
    if (x & 1) {
        swap(a.ev, a.od);
    }
    return a;
}
struct segtree {
    int n;
    vector<T> dat;
    vector<ll> la, lb, len;
    segtree(int n_) {
        n = 1;
        while (n < n_) {
            n <<= 1;
        }
        dat.resize(2 * n, T{0, 0, 0});
        la.resize(2 * n);
        lb.resize(2 * n);
        len.resize(2 * n);
        for (int i = n; i < 2 * n; i++) {
            len[i] = 1;
            dat[i].ev = 1;
        }
        for (int i = n - 1; i > 0; i--) {
            len[i] = len[i << 1] + len[i << 1 | 1];
            dat[i] = f(dat[i << 1], dat[i << 1 | 1]);
        }
    }
    void eval(int k) {
        dat[k] = ga(dat[k], la[k]);
        dat[k] = gb(dat[k], lb[k], len[k]);
        if (k < n) {
            la[k << 1] |= la[k];
            la[k << 1 | 1] |= la[k];
            lb[k << 1] += lb[k];
            lb[k << 1 | 1] += lb[k];
        }
        la[k] = 0;
        lb[k] = 0;
    }
    void upd(int a, int b, ll x, int k, int l, int r) {
        eval(k);
        if (b <= l || r <= a) {
            return;
        }
        if (a <= l && r <= b) {
            if (x == -1) {
                la[k] |= 1;
            } else {
                lb[k] += x;
            }
            eval(k);
            return;
        }
        int m = (l + r) / 2;
        upd(a, b, x, k << 1, l, m);
        upd(a, b, x, k << 1 | 1, m, r);
        dat[k] = f(dat[k << 1], dat[k << 1 | 1]);
    }
    T get(int a, int b, int k, int l, int r) {
        eval(k);
        if (b <= l || r <= a) {
            return T{0, 0, 0};
        }
        if (a <= l && r <= b) {
            return dat[k];
        }
        int m = (l + r) / 2;
        return f(get(a, b, k << 1, l, m), get(a, b, k << 1 | 1, m, r));
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    segtree seg(n + 10);
    for (int i = 0; i < n; i++) {
        ll a;
        cin >> a;
        seg.upd(i, i + 1, a, 1, 0, seg.n);
    }
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        --l;
        if (t == 1) {
            seg.upd(l, r, -1, 1, 0, seg.n);
        } else if (t == 2) {
            ll x;
            cin >> x;
            seg.upd(l, r, x, 1, 0, seg.n);
        } else {
            cout << (seg.get(l, r, 1, 0, seg.n)).sum << '\n';
        }
    }
}