#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int64 > A(N);
  cin >> A;

  vector< tuple< int, int, int, int > > qs;
  const int B = 1024;
  for(int i = 0; i < Q; i++) {
    {
      int t, l, r, x;
      cin >> t >> l >> r;
      --l;
      if(t == 2) cin >> x;
      qs.emplace_back(t, l, r, x);
    }

    if(qs.size() == B || i + 1 == Q) {
      vector< int > used(N + 1);
      for(auto &p : qs) used[get< 1 >(p)] = 1;
      for(auto &p : qs) used[get< 2 >(p)] = 1;
      vector< int > idx;
      for(int j = 0; j <= N; j++) {
        if(used[j] == 1) {
          used[j] = (int) idx.size();
          idx.emplace_back(j);
        }
      }
      vector< int64 > odd_sum(idx.size() - 1), even_sum(idx.size() - 1);
      vector< int > odd_sz(idx.size() - 1), even_sz(idx.size() - 1);
      vector< int64 > odd_add(idx.size() - 1), even_add(idx.size() - 1);
      vector< int > flip(idx.size() - 1), change(idx.size() - 1);

      for(int j = 0; j + 1 < idx.size(); j++) {
        for(int k = idx[j]; k < idx[j + 1]; k++) {
          if(A[k] & 1) {
            odd_sum[j] += A[k];
            odd_sz[j] += 1;
          } else {
            even_sum[j] += A[k];
            even_sz[j] += 1;
          }
        }
      }
      for(auto &p : qs) {
        int t, l, r, x;
        tie(t, l, r, x) = p;
        if(t == 1) {
          for(int k = used[l]; k < used[r]; k++) {
            change[k] = true;
            odd_add[k] = 1;
            even_add[k] = 0;
          }
        } else if(t == 2) {
          if(x & 1) {
            for(int k = used[l]; k < used[r]; k++) {
              swap(odd_sum[k], even_sum[k]);
              swap(odd_add[k], even_add[k]);
              swap(odd_sz[k], even_sz[k]);
              flip[k] ^= 1;
            }
          }
          for(int k = used[l]; k < used[r]; k++) {
            odd_add[k] += x;
            even_add[k] += x;
          }
        } else {
          int64 sum = 0;
          for(int k = used[l]; k < used[r]; k++) {
            if(!change[k]) {
              sum += odd_sum[k];
              sum += even_sum[k];
            }
            sum += odd_add[k] * odd_sz[k];
            sum += even_add[k] * even_sz[k];
          }
          cout << sum << "\n";
        }
      }


      for(int j = 0; j + 1 < idx.size(); j++) {
        if(change[j]) {
          for(int k = idx[j]; k < idx[j + 1]; k++) {
            if((A[k] & 1) ^ flip[j]) A[k] = odd_add[j];
            else A[k] = even_add[j];
          }
        } else {
          for(int k = idx[j]; k < idx[j + 1]; k++) {
            if((A[k] & 1) ^ flip[j]) A[k] += odd_add[j];
            else A[k] += even_add[j];
          }
        }
      }
      qs.clear();
    }
  }
}