/* -*- coding: utf-8 -*-
 *
 * 879.cc:  No.879 Range Mod 2 Query  - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_E2 = 1 << 18; // = 262144

/* typedef */

typedef long long ll;

template <typename T, const int MAX_E2>
struct SegTreeSum {
  int n, e2;
  T nodes[MAX_E2], dls[MAX_E2];
  int prts[MAX_E2];
  bool clrs[MAX_E2];
  SegTreeSum() {}

  void init(int _n) {
    n = _n;
    for (e2 = 1; e2 < n; e2 <<= 1);
    memset(nodes, 0, sizeof(nodes));
    memset(dls, 0, sizeof(dls));
    memset(prts, 0, sizeof(prts));
    memset(clrs, false, sizeof(clrs));
    //fill(nodes, nodes + MAX_E2, inf);
  }

  T &get(int i) { return nodes[e2 - 1 + i]; }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    prts[j] = (v & 1);
  }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--) {
      int j0 = j * 2 + 1, j1 = j0 + 1;
      nodes[j] = nodes[j0] + nodes[j1];
      prts[j] = prts[j0] + prts[j1];
    }
  }

  void _update(int k, int l) {
    int k0 = k * 2 + 1, k1 = k0 + 1;
    if (clrs[k]) {
      nodes[k0] = prts[k0], nodes[k1] = prts[k1];
      dls[k0] = dls[k1] = 0;
      clrs[k0] = clrs[k1] = true;
      clrs[k] = false;
    }
    if (dls[k] != 0) {
      int l0 = (l >> 1);
      nodes[k0] += dls[k] * l0, nodes[k1] += dls[k] * l0;
      dls[k0] += dls[k], dls[k1] += dls[k];
      if (dls[k] & 1)
	prts[k0] = l0 - prts[k0], prts[k1] = l0 - prts[k1];
      dls[k] = 0;
    }
  }

  void clear_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k] = prts[k];
      clrs[k] = true;
      return;
    }

    _update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    clear_range(r0, r1, k0, i0, im);
    clear_range(r0, r1, k1, im, i1);

    nodes[k] = nodes[k0] + nodes[k1];
  }
  void clear_range(int r0, int r1) { return clear_range(r0, r1, 0, 0, e2); }

  void add_range(int r0, int r1, T v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      int l = i1 - i0;
      nodes[k] += v * l;
      if (v & 1) prts[k] = l - prts[k];
      dls[k] += v;
      return;
    }

    _update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    add_range(r0, r1, v, k0, i0, im);
    add_range(r0, r1, v, k1, im, i1);

    nodes[k] = nodes[k0] + nodes[k1];
    prts[k] = prts[k0] + prts[k1];
  }
  void add_range(int r0, int r1, T v) {return add_range(r0, r1, v, 0, 0, e2);}

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return 0;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    _update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};

/* global variables */

SegTreeSum<ll,MAX_E2> st;

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);

  st.init(n);

  for (int i = 0; i < n; i++) {
    int ai;
    scanf("%d", &ai);
    st.set(i, ai);
  }
  st.setall();

  while (qn--) {
    int c, l, r;
    scanf("%d%d%d", &c, &l, &r);
    l--;

    if (c == 1) {
      st.clear_range(l, r);
    }
    else if (c == 2) {
      int x;
      scanf("%d", &x);
      st.add_range(l, r, x);
    }
    else {
      ll sum = st.sum_range(l, r);
      printf("%lld\n", sum);
    }
  }

  return 0;
}