#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

struct Node {
    ll x, ecnt, ocnt;
    Node() :x(0), ecnt(1), ocnt(0) {}
    Node(ll _x, ll _ecnt, ll _ocnt) :x(_x), ecnt(_ecnt), ocnt(_ocnt) {}
    Node operator+(const Node& n) const{
        return Node(x + n.x, ecnt + n.ecnt, ocnt + n.ocnt);
    }
};

Node f(Node a, Node b) { return a + b; }

Node g(Node a, pair<ll, ll> b) {
    Node res = a;
    if (b.first == 1) {
        res.x = res.ocnt;
    }
    else if(b.first == 2){
        swap(res.ocnt, res.ecnt);
        res.x = res.ocnt;
    }
    res.x += b.second * (res.ocnt + res.ecnt);
    if (b.second & 1) swap(res.ocnt, res.ecnt);
    return res;
}

pair<ll, int> h(pair<ll, ll> a, pair<ll, ll> b) {
    if (b.first) {
        if ((a.first != 2 and (a.second & 1)) or (a.first == 2 and !(a.second & 1))) {
            if (b.first == 1) b.first = 2;
            else b.first = 1;
        }
        return b;
    }
    else {
        return { a.first, a.second + b.second };
    }
}

template< typename Monoid, typename OperatorMonoid = Monoid >
struct LazySegmentTree {
    /*
    using F = function< Monoid(Monoid, Monoid) >;
    using G = function< Monoid(Monoid, OperatorMonoid) >;
    using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;
    */
    int sz, height;
    vector< Monoid > data;
    vector< OperatorMonoid > lazy;
    /*
    const F f;
    const G g;
    const H h;
    */
    const Monoid M1;
    const OperatorMonoid OM0;


    LazySegmentTree(int n, /*const F f, const G g, const H h,*/
        const Monoid& M1, const OperatorMonoid OM0)
        : /*f(f), g(g), h(h),*/ M1(M1), OM0(OM0) {
        sz = 1;
        height = 0;
        while (sz < n) sz <<= 1, height++;
        data.assign(2 * sz, M1);
        lazy.assign(2 * sz, OM0);
    }

    void set(int k, const Monoid& x) {
        data[k + sz] = x;
    }

    void build() {
        for (int k = sz - 1; k > 0; k--) {
            data[k] = f(data[2 * k + 0], data[2 * k + 1]);
        }
    }

    inline void propagate(int k) {
        if (lazy[k] != OM0) {
            lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
            lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
            data[k] = reflect(k);
            lazy[k] = OM0;
        }
    }

    inline Monoid reflect(int k) {
        return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
    }

    inline void recalc(int k) {
        while (k >>= 1) data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
    }

    inline void thrust(int k) {
        for (int i = height; i > 0; i--) propagate(k >> i);
    }

    void update(int a, int b, const OperatorMonoid& x) {
        if (a >= b) return;
        thrust(a += sz);
        thrust(b += sz - 1);
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) lazy[l] = h(lazy[l], x), ++l;
            if (r & 1) --r, lazy[r] = h(lazy[r], x);
        }
        recalc(a);
        recalc(b);
    }

    Monoid query(int a, int b) {
        if (a >= b) return M1;
        thrust(a += sz);
        thrust(b += sz - 1);
        Monoid L = M1, R = M1;
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = f(L, reflect(l++));
            if (r & 1) R = f(reflect(--r), R);
        }
        return f(L, R);
    }

    Monoid operator[](const int& k) {
        return query(k, k + 1);
    }

};


int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */

    int n, kkt; scanf("%d %d", &n, &kkt);
    LazySegmentTree<Node, pair<ll, ll>> lsg(n, Node(), { 0,0 });
    for (int i = 0; i < n; i++) {
        int x; scanf("%d", &x);
        lsg.set(i, Node(x, x % 2 == 0, x % 2 == 1));
    }
    lsg.build();
    while (kkt--) {
        int t, l, r; scanf("%d %d %d", &t, &l, &r); l--;
        if (t == 1) {
            lsg.update(l, r, { 1,0 });
        }
        if (t == 2) {
            int x; scanf("%d", &x);
            lsg.update(l, r, { 0,x });
        }
        if (t == 3) {
            auto res = lsg.query(l, r);
            printf("%lld\n", res.x);
        }
    }
    return 0;
}