#include <bits/stdc++.h>
using namespace std;

template<int n, typename E, typename T, typename FTE, typename FTT, typename FEE>
struct Segt {
  E dat[n << 1], ei;
  T tag[n << 1], ti;
  FTE fte;
  FTT ftt;
  FEE fee;
  Segt(FTE a, FTT b, FEE c, E ei, T ti)
      : fte(a), ftt(b), fee(c), ei(ei), ti(ti) {
    fill(dat, dat + 2 * n, ei);
    fill(tag, tag + 2 * n, ti);
  }
  void build(vector<E> a) {
    a.resize(n, ei);
    function<void(int, int, int)> rec = [&](int lb, int rb, int k) {
      if (rb - lb == 1) return void(dat[k] = a[lb]);
      rec(lb, lb + rb >> 1, k << 1);
      rec(lb + rb >> 1, rb, k << 1 | 1);
      dat[k] = fee(dat[k << 1], dat[k << 1 | 1]);
    };
    rec(0, n, 1);
  }
  void push(int k) {
    dat[k] = fte(tag[k], dat[k]);
    for (int c = 0; k < n && c < 2; ++c) tag[k << 1 | c] = ftt(tag[k], tag[k << 1 | c]);
    tag[k] = ti;
  }
  void update(T t, int ql, int qr, int lb = 0, int rb = n, int k = 1) {
    push(k);
    if (qr <= lb || rb <= ql) return;
    if (ql <= lb && rb <= qr) {
      tag[k] = t;
      push(k);
      return;
    }
    int mb = lb + rb >> 1;
    update(t, ql, qr, lb, mb, k << 1);
    update(t, ql, qr, mb, rb, k << 1 | 1);
    dat[k] = fee(dat[k << 1], dat[k << 1 | 1]);
  }
  E query(int ql, int qr, int lb = 0, int rb = n, int k = 1) {
    push(k);
    if (qr <= lb || rb <= ql) return ei;
    if (ql <= lb && rb <= qr) return dat[k];
    int mb = lb + rb >> 1;
    return fee(query(ql, qr, lb, mb, k << 1), query(ql, qr, mb, rb, k << 1 | 1));
  }
};

int main() {
  ios::sync_with_stdio(false);

  int N, Q;
  cin >> N >> Q;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  typedef valarray<int64_t> T; // (mtag, stag, atag)
  typedef valarray<int64_t> E; // (vsum, cnt0, cnt1)
  function<E(T, E)> fte = [](T f, E e) {
    if (f[0]) {
      if (f[1]) swap(e[1], e[2]);
      e[0] = e[2];
    }
    if (f[2] & 1) swap(e[1], e[2]);
    e[0] += f[2] * (e[1] + e[2]);
    return e;
  };
  function<T(T, T)> ftt = [](T f, T t) {
    return T({
      f[0] | t[0],
      f[0] ? f[1] + t[1] + t[2] & 1 : t[1],
      f[0] ? f[2] : f[2] + t[2]
    });
  };
  function<E(E, E)> fee = [](E l, E r) { return l + r; };
  static Segt<(1 << 17), E, T, decltype(fte), decltype(ftt), decltype(fee)> tree(fte, ftt, fee, T(3), E(3));

  vector<E> ea(N);
  transform(A.begin(), A.end(), ea.begin(), [&](int v) { return E({ v, ~v & 1, v & 1 }); });
  tree.build(ea);

  while (Q--) {
    int P, L, R;
    cin >> P >> L >> R;
    --L;
    if (P == 1) {
      tree.update(T({ 1, 0, 0 }), L, R);
    } else if (P == 2) {
      int X;
      cin >> X;
      tree.update(T({ 0, 0, X }), L, R);
    } else {
      cout << tree.query(L, R)[0] << endl;
    }
  }

  return 0;
}