#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T> bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T> bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
    for (int i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "\n" : " ");
    }
    return os;
}
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, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(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);
    }
};

struct Segtree {
    int n;
    vector<ll> dat, laz, sum, flg, la2, vl, vr;
    Segtree(int n_) {
        n = 1;
        while (n < n_) {
            n <<= 1;
        }
        dat.resize(2 * n);
        laz.resize(2 * n);
        sum.resize(2 * n);
        flg.resize(2 * n);
        la2.resize(2 * n);
        vl.resize(2 * n);
        vr.resize(2 * n);
        build();
    }
    void build(int k = 1, int l = 0, int r = -1) {
        if (r < 0) {
            r = n;
        }
        vl[k] = l;
        vr[k] = r;
        build(2 * k, l, (l + r) / 2);
        build(2 * k + 1, (l + r) / 2, r);
    }
    void prop(int k) {
        dat[k] += laz[k];
        sum[k] += la2[k] * (vr[k] - vl[k] - sum[k]) - la2[k] * sum[k];
        if (flg[k]) {
            dat[k] = sum[k];
        }
        if (k < n) {
            laz[k << 1] += laz[k] / 2LL;
            laz[k << 1 | 1] += laz[k] / 2LL;
            la2[k << 1] += la2[k];
            la2[k << 1 | 1] += la2[k];
            flg[k << 1] |= flg[k];
            flg[k << 1 | 1] |= flg[k];
        }
        flg[k] = 0;
        laz[k] = 0;
        la2[k] = 0;
    }
    void add(const int &a, const int &b, const ll &x, int k = 1, ll l = 0,
             ll r = -1) {
        if (r < 0) {
            r = n;
        }
        prop(k);
        if (b <= l || r <= a) {
            return;
        }
        if (a <= l && r <= b) {
            laz[k] += x * (r - l);
            prop(k);
            la2[k] += x % 2LL;
            prop(k);
            return;
        }
        add(a, b, x, 2 * k, l, (l + r) / 2);
        add(a, b, x, 2 * k + 1, (l + r) / 2, r);
        dat[k] = dat[k << 1] + dat[k << 1 | 1];
        sum[k] = sum[k << 1] + sum[k << 1 | 1];
    }
    void eo(const int &a, const int &b, int k = 1, int l = 0, int r = -1) {
        if (r < 0) {
            r = n;
        }
        prop(k);
        if (b <= l || r <= a) {
            return;
        }
        if (a <= l && r <= b) {
            flg[k] = 1;
            prop(k);
            return;
        }
        eo(a, b, 2 * k, l, (l + r) / 2);
        eo(a, b, 2 * k + 1, (l + r) / 2, r);
        dat[k] = dat[k << 1] + dat[k << 1 | 1];
        sum[k] = sum[k << 1] + sum[k << 1 | 1];
    }
    ll get(const int &a, const int &b, int k = 1, int l = 0, int r = -1) {
        if (r < 0) {
            r = n;
        }
        prop(k);
        if (b <= l || r <= a) {
            return 0;
        }
        if (a <= l && r <= b) {
            return dat[k];
        }
        return get(a, b, 2 * k, l, (l + r) / 2) +
               get(a, b, 2 * k + 1, (l + r) / 2, r);
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    Segtree seg(n);
    for (int i = 0; i < n; i++) {
        ll a;
        cin >> a;
        seg.add(i, i + 1, a);
    }
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        --l;
        if (t == 1) {
            seg.eo(l, r);
        } else if (t == 2) {
            ll x;
            cin >> x;
            seg.add(l, r, x);
        } else {
            cout << seg.get(l, r) << endl;
        }
    }
}