#include <bits/stdc++.h>
// clang-format off
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
template <typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template <typename T>
std::vector<T> readVec(const std::size_t l)
{
    std::vector<T> v(l);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template <typename T>
bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!===================================================================!//
//!  .d88888b                    d888888P                             !//
//!  88.    "'                      88                                !//
//!  'Y88888b. .d8888b. .d8888b.    88    88d888b. .d8888b. .d8888b.  !//
//!        '8b 88ooood8 88'  '88    88    88'  '88 88ooood8 88ooood8  !//
//!  d8'   .8P 88.  ... 88.  .88    88    88       88.  ... 88.  ...  !//
//!   Y88888P  '88888P' '8888P88    dP    dP       '88888P' '88888P'  !//
//!                          .88                                      !//
//!                      d8888P                                       !//
//!===================================================================!//
template <typename ValMonoid>
class SegTree
{
public:
    using ValType = typename ValMonoid::ValType;
    SegTree(const std::size_t N, const ValType initial = ValMonoid::id()) : size(N), half(ceil2(size)), val(half << 1, ValMonoid::id())
    {
        if (initial != ValMonoid::id()) {
            std::fill(val.begin() + half, val.end(), initial);
            for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
        }
    }
    template <typename InIt>
    SegTree(const InIt first, const InIt last) : size(std::distance(first, last)), half(ceil2(size)), val(half << 1, ValMonoid::id())
    {
        std::copy(first, last, val.begin() + half);
        for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
    }
    ValType get(const std::size_t a) const { return assert(a < size), val[a + half]; }
    void set(std::size_t a, const ValType& v)
    {
        assert(a < size);
        val[a += half] = v;
        while (a >>= 1) { up(a); }
    }
    ValType fold(std::size_t L, std::size_t R) const
    {
        assert(L < R), assert(R <= size);
        ValType accl = ValMonoid::id(), accr = ValMonoid::id();
        for (L += half, R += half; L < R; L >>= 1, R >>= 1) {
            if (L & 1) { accl = acc(accl, val[L++]); }
            if (R & 1) { accr = acc(val[--R], accr); }
        }
        return acc(accl, accr);
    }
    friend std::ostream& operator<<(std::ostream& os, const SegTree& seg)
    {
        os << "[";
        for (std::size_t i = seg.half; i < seg.half + seg.size; i++) { os << seg.val[i] << (i + 1 == seg.half + seg.size ? "" : ","); }
        return (os << "]\n");
    }

private:
    void up(const std::size_t i) { val[i] = acc(val[i << 1], val[i << 1 | 1]); }
    const std::size_t size, half;
    std::vector<ValType> val;
    const ValMonoid acc{};
};
//!======================================================================================!//
//!   a88888b.          .d88888b                    d888888P                             !//
//!  d8'   '88          88.    "'                      88                                !//
//!  88        .d8888b. 'Y88888b. .d8888b. .d8888b.    88    88d888b. .d8888b. .d8888b.  !//
//!  88        88'  '88       '8b 88ooood8 88'  '88    88    88'  '88 88ooood8 88ooood8  !//
//!  Y8.   .88 88.  .88 d8'   .8P 88.  ... 88.  .88    88    88       88.  ... 88.  ...  !//
//!   Y88888P' '88888P'  Y88888P  '88888P' '8888P88    dP    dP       '88888P' '88888P'  !//
//!                                             .88                                      !//
//!                                         d8888P                                       !//
//!======================================================================================!//
template <typename OpMonoid>
class CoSegTree
{
public:
    using OpType = typename OpMonoid::OpType;
    CoSegTree(const std::size_t N, const OpType& initial = OpMonoid::id()) : size(N), depth(clog(size)), half(1 << depth), op(half << 1, OpMonoid::id())
    {
        if (initial != OpMonoid::id()) { std::fill(op.begin() + half, op.end(), initial); }
    }
    template <typename InIt>
    CoSegTree(const InIt first, const InIt last) : size(std::distance(first, last)), depth(clog(size)), half(ceil2(size)), op(half << 1, OpMonoid::id()) { std::copy(first, last, op.begin() + half); }
    OpType get(const std::size_t a) const
    {
        assert(a < size);
        OpType ans = OpMonoid::id();
        for (std::size_t i = 0; i <= depth; i++) { ans = compose(ans, op[(a + half) >> (depth - i)]); }
        return ans;
    }
    void act(std::size_t L, std::size_t R, const OpType& f)
    {
        assert(L < R), assert(R <= size);
        cleanup(L += half), cleanup(R += half);
        for (; L < R; L >>= 1, R >>= 1) {
            if (L & 1) { update(L++, f); }
            if (R & 1) { update(--R, f); }
        }
    }

    friend std::ostream& operator<<(std::ostream& os, const CoSegTree& seg)
    {
        os << "[";
        for (std::size_t i = 0; i < seg.size; i++) { os << seg.get(i) << (i + 1 == seg.size ? "" : ","); }
        return (os << "]\n");
    }

private:
    void down(const std::size_t a) { update(a << 1, op[a]), update(a << 1 | 1, op[a]), op[a] = OpMonoid::id(); }
    void cleanup(const std::size_t a)
    {
        const std::size_t b = (a / (a & -a)) >> 1;
        for (std::size_t i = 0; i < depth; i++) {
            const std::size_t v = a >> (depth - i);
            if (v > b) { break; }
            down(v);
        }
    }
    void update(const std::size_t a, const OpType& f) { op[a] = compose(f, op[a]); }
    const std::size_t size, depth, half;
    std::vector<OpType> op;
    const OpMonoid compose{};
};
//!=======================================================================!//
//!  dP                                      .d88888b                     !//
//!  88                                      88.    "'                    !//
//!  88        .d8888b. d888888b dP    dP    'Y88888b. .d8888b. .d8888b.  !//
//!  88        88'  '88    .d8P' 88    88          '8b 88ooood8 88'  '88  !//
//!  88        88.  .88  .Y8P    88.  .88    d8'   .8P 88.  ... 88.  .88  !//
//!  88888888P '88888P8 d888888P '8888P88     Y88888P  '88888P' '8888P88  !//
//!                                   .88                            .88  !//
//!                               d8888P                         d8888P   !//
//!=======================================================================!//
template <typename MAct>
class LazySeg
{
public:
    using ValMonoid = typename MAct::ValMonoid;
    using OpMonoid = typename MAct::OpMonoid;
    using ValType = typename ValMonoid::ValType;
    using OpType = typename OpMonoid::OpType;
    LazySeg(const std::size_t N, const ValType initial = ValMonoid::id()) : size(N), depth(clog(size)), half(1 << depth), val(half << 1, ValMonoid::id()), op(half << 1, OpMonoid::id())
    {
        if (initial != ValMonoid::id()) {
            std::fill(val.begin() + half, val.end(), initial);
            for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
        }
    }
    template <typename InIt>
    LazySeg(const InIt first, const InIt last) : size(std::distance(first, last)), depth(clog(size)), half(1 << depth), val(half << 1, ValMonoid::id()), op(half << 1, OpMonoid::id())
    {
        std::copy(first, last, val.begin() + half);
        for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
    }
    ValType get(const std::size_t a) { return assert(a < size), fold(a, a + 1); }
    void set(std::size_t a, const ValType& v)
    {
        assert(a < size);
        topDown(a += half), op[a] = OpMonoid::id(), val[a] = v;
        while (a >>= 1) { up(a); }
    }
    ValType fold(std::size_t L, std::size_t R)
    {
        assert(L < R);
        assert(R <= size);
        topDown(L += half), topDown(R += half);
        ValType accl = ValMonoid::id(), accr = ValMonoid::id();
        for (; L < R; L >>= 1, R >>= 1) {
            if (L & 1) { accl = acc(accl, val[L++]); }
            if (R & 1) { accr = acc(val[--R], accr); }
        }
        return acc(accl, accr);
    }
    void act(std::size_t L, std::size_t R, const OpType& f)
    {
        assert(L < R), assert(R <= size);
        const std::size_t l = L + half, r = R + half;
        topDown(L += half), topDown(R += half);
        for (std::size_t ls = 1, rs = 1; L < R; L >>= 1, R >>= 1, ls <<= 1, rs <<= 1) {
            if (L & 1) { update(L++, f, ls); }
            if (R & 1) { update(--R, f, rs); }
        }
        bottomUp(l), bottomUp(r);
    }
    friend std::ostream& operator<<(std::ostream& os, LazySeg& lseg)
    {
        os << "[";
        for (std::size_t i = 0; i < lseg.size; i++) { os << lseg.get(i) << (i + 1 == lseg.size ? "" : ","); }
        return (os << "]\n");
    }

private:
    void up(const std::size_t i) { val[i] = acc(val[i << 1], val[i << 1 | 1]); }
    void update(const std::size_t a, const OpType& f, const std::size_t l) { op[a] = compose(f, op[a]), val[a] = eval(f, val[a], l); }
    void down(const std::size_t a, const std::size_t l) { update(a << 1, op[a], l >> 1), update(a << 1 | 1, op[a], l >> 1), op[a] = OpMonoid::id(); }
    void topDown(const std::size_t a)
    {
        const std::size_t b = (a / (a & -a)) >> 1;
        for (std::size_t i = 0, l = half; i < depth; i++, l >>= 1) {
            const std::size_t v = a >> (depth - i);
            if (v > b) { break; }
            down(v, l);
        }
    }
    void bottomUp(std::size_t a)
    {
        a = (a / (a & -a)) >> 1;
        for (; a >= 1; a >>= 1) { up(a); }
    }
    const std::size_t size, depth, half;
    std::vector<ValType> val;
    std::vector<OpType> op;
    const ValMonoid acc{};
    const OpMonoid compose{};
    const MAct eval{};
};
// clang-format on
//!=====================================!//
//!  8888ba.88ba           oo           !//
//!  88  '8b  '8b                       !//
//!  88   88   88 .d8888b. dP 88d888b.  !//
//!  88   88   88 88'  '88 88 88'  '88  !//
//!  88   88   88 88.  .88 88 88    88  !//
//!  dP   dP   dP '88888P8 dP dP    dP  !//
//!=====================================!//
struct ValMonoid
{
    struct ValType
    {
        ll on = 0, en = 0;
        ll os = 0, es = 0;
    };
    friend std::ostream& operator<<(std::ostream& os, const ValType& o) { return os << "[" << o.on << "," << o.en << ":" << o.os << "," << o.es << "]"; }
    ValType operator()(const ValType& a, const ValType& b) const { return {a.on + b.on, a.en + b.en, a.os + b.os, a.es + b.es}; }
    static constexpr ValType id() { return ValType{}; }
};
struct OpMonoid
{
    struct OpType
    {
        bool set = false;
        ll odd = 0, even = 0;
        ll plus = 0;
    };
    friend std::ostream& operator<<(std::ostream& os, const OpType& o) { return os << "[" << o.set << ":" << o.odd << "," << o.even << ":" << o.plus << "]"; }
    OpType operator()(const OpType& f1, const OpType& f2) const
    {
        if (f1.set) {
            if (f2.set) {
                if (f2.odd % 2 != 0) {
                    return f1;
                } else {
                    return OpType{true, f1.even, f1.odd, 0};
                }
            } else {
                if (f2.plus % 2 == 0) {
                    return f1;
                } else {
                    return OpType{true, f1.even, f1.odd, 0};
                }
            }
        } else {
            if (f2.set) {
                return OpType{true, f2.odd + f1.plus, f2.even + f1.plus, 0};
            } else {
                return OpType{false, 0, 0, f1.plus + f2.plus};
            }
        }
    }
    static constexpr OpType id() { return OpType{}; }
};
struct M_Act
{
    using ValMonoid = ::ValMonoid;
    using OpMonoid  = ::OpMonoid;
    using ValType   = typename ValMonoid::ValType;
    using OpType    = typename OpMonoid::OpType;
    template<typename Ind>
    ValType operator()(const OpType& f, const ValType& x, const Ind) const
    {
        if (f.set) {
            ll on = 0, en = 0;
            if (f.odd % 2 == 0) {
                en += x.on;
            } else {
                on += x.on;
            }
            if (f.even % 2 == 0) {
                en += x.en;
            } else {
                on += x.en;
            }
            return ValType{on, en, on * f.odd, en * f.even};
        } else {
            ll on = 0, en = 0;
            ll os = 0, es = 0;
            if (f.plus % 2 == 0) {
                on = x.on;
                en = x.en;
                os = x.os + f.plus * on;
                es = x.es + f.plus * en;
            } else {
                on = x.en;
                en = x.on;
                os = x.es + f.plus * en;
                es = x.os + f.plus * on;
            }
            return ValType{on, en, os, es};
        }
    }
};
int main()
{
    const int N = read<int>(), Q = read<int>();
    const auto a = readVec<ll>(N);
    using T      = ValMonoid::ValType;
    std::vector<T> v(N);
    for (int i = 0; i < N; i++) {
        if (a[i] % 2 == 0) {
            v[i] = {0, 1, 0, a[i]};
        } else {
            v[i] = {1, 0, a[i], 0};
        }
    }
    LazySeg<M_Act> seg(v.begin(), v.end());
    for (int i = 0; i < Q; i++) {
        const int t = read<int>();
        const int l = read<int>() - 1, r = read<int>();
        SHOW(seg);
        if (t == 1) {
            seg.act(l, r, {true, 1, 0, 0});
        } else if (t == 2) {
            const ll x = read<ll>();
            seg.act(l, r, {false, 0, 0, x});
        } else {
            const auto s = seg.fold(l, r);
            std::cout << s.os + s.es << std::endl;
        }
    }
    return 0;
}