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

template<int n, typename E, typename T, typename FTE, typename FTT, typename FEE>
struct Segt {
  vector<E> dat;
  vector<T> tag;
  FTE fte;
  FTT ftt;
  FEE fee;
  E ei;
  T ti;
  Segt(FTE a, FTT b, FEE c, E ei, T ti)
      : fte(a), ftt(b), fee(c), ei(ei), ti(ti) {
    dat.assign(2 * n, ei);
    tag.assign(2 * n, ti);
  }
  void build(vector<E> a) {
    for (int i = 0; i < a.size(); ++i) dat[n + i] = a[i];
    for (int i = n - 1; i; --i) dat[i] = fee(dat[i << 1], dat[i << 1 | 1]);
  }
  void push(int k) {
    for (int c = 0; c < 2; ++c) {
      tag[k << 1 | c] = ftt(tag[k], tag[k << 1 | c]);
      dat[k << 1 | c] = fte(tag[k], dat[k << 1 | c]);
    }
    tag[k] = ti;
  }
  void update(T t, int ql, int qr, int lb = 0, int rb = n, int k = 1) {
    if (qr <= lb || rb <= ql) return;
    if (ql <= lb && rb <= qr) {
      tag[k] = ftt(t, tag[k]);
      dat[k] = fte(t, dat[k]);
      return;
    }
    push(k);
    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) {
    if (qr <= lb || rb <= ql) return ei;
    if (ql <= lb && rb <= qr) return dat[k];
    push(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 struct { int mtag, stag; int64_t atag; } T;
  typedef struct { int64_t vsum; int cnt0, cnt1; } E;
  function<E(T, E)> fte = [](T f, E e) {
    if (f.mtag) {
      if (f.stag) swap(e.cnt0, e.cnt1);
      e.vsum = e.cnt1;
    }
    if (f.atag & 1) swap(e.cnt0, e.cnt1);
    e.vsum += f.atag * (e.cnt0 + e.cnt1);
    return e;
  };
  function<T(T, T)> ftt = [](T f, T t) {
    return T({
      f.mtag | t.mtag,
      f.mtag ? f.stag + t.stag + t.atag & 1 : t.stag,
      f.mtag ? f.atag : f.atag + t.atag
    });
  };
  function<E(E, E)> fee = [](E l, E r) { return E({ l.vsum + r.vsum, l.cnt0 + r.cnt0, l.cnt1 + r.cnt1 }); };
  Segt<(1 << 17), E, T, decltype(fte), decltype(ftt), decltype(fee)> tree(fte, ftt, fee, E({0,0,0}), T({0,0,0}));

  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).vsum << '\n';
    }
  }

  return 0;
}