#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

constexpr int U = 1 << 17;

using vec = array<ll, 4>;
using mat = array<array<ll, 4>, 4>;

mat operator*(mat a, mat b) {
  mat res = {};
  rep(i, 4) rep(k, 4) rep(j, 4) res[i][j] += a[i][k] * b[k][j];
  return res;
}

vec operator*(mat a, vec b) {
  vec res = {};
  rep(i, 4) rep(j, 4) res[i] += a[i][j] * b[j];
  return res;
}

vec operator+(vec a, vec b) {
  rep(i, 4) a[i] += b[i];
  return a;
}

mat unit() {
  mat res = {};
  rep(i, 4) rep(j, 4) res[i][j] = i == j;
  return res;
}

vec dat[U * 2];
mat lazy[U * 2];

void apply(int k, mat v) {
  lazy[k] = v * lazy[k];
  dat[k] = v * dat[k];
}

void push(int k) {
  apply(k * 2 + 0, lazy[k]);
  apply(k * 2 + 1, lazy[k]);
  lazy[k] = unit();
}

void pull(int k) {
  dat[k] = dat[k * 2] + dat[k * 2 + 1];
}

void update(int a, int b, mat v, int k = 1, int l = 0, int r = U) {
  if (r <= a || b <= l) return;
  if (a <= l && r <= b) {
    apply(k, v);
    return;
  }
  push(k);
  int m = (l + r) / 2;
  update(a, b, v, k * 2 + 0, l, m);
  update(a, b, v, k * 2 + 1, m, r);
  pull(k);
}

vec query(int a, int b, int k = 1, int l = 0, int r = U) {
  if (r <= a || b <= l) return vec{};
  if (a <= l && r <= b) return dat[k];
  push(k);
  int m = (l + r) / 2;
  vec vl = query(a, b, k * 2 + 0, l, m);
  vec vr = query(a, b, k * 2 + 1, m, r);
  return vl + vr;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int N, Q; cin >> N >> Q;
  vector<int> A(N);
  rep(i, U * 2) lazy[i] = unit();
  rep(i, N) {
    cin >> A[i];
    dat[i + U][0] = A[i];
    dat[i + U][1] = A[i] % 2;
    dat[i + U][2] = (A[i] + 1) % 2;
    dat[i + U][3] = 1;
  }
  for (int i = U - 1; i >= 1; i--) pull(i);
  while (Q--) {
    int type; cin >> type;
    if (type == 1) {
      int l, r; cin >> l >> r; l--;
      mat v = {
        vec{0, 1, 0, 0},
        vec{0, 1, 0, 0},
        vec{0, 0, 1, 0},
        vec{0, 0, 0, 1},
      };
      update(l, r, v);
    } else if (type == 2) {
      int l, r, x; cin >> l >> r >> x; l--;
      if (x % 2 == 1) {
        mat v = {
          vec{1, 0, 0, x},
          vec{0, 0, 1, 0},
          vec{0, 1, 0, 0},
          vec{0, 0, 0, 1},
        };
        update(l, r, v);
      } else {
        mat v = {
          vec{1, 0, 0, x},
          vec{0, 1, 0, 0},
          vec{0, 0, 1, 0},
          vec{0, 0, 0, 1},
        };
        update(l, r, v);
      }
    } else {
      int l, r; cin >> l >> r; l--;
      vec ans = query(l, r);
      cout << ans[0] << '\n';
    }
  }
}