// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

#define random_shuffle "USE std::shuffle!";

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------



signed main() {
	INIT;

	VAR(int, n, Q);
	VEC(int, a, n);

	constexpr int B = 320;
	struct Seg { int o, e, s; V<PAIR> laz; };
	V<Seg> seg((n + B - 1) / B, Seg{ 0,0,0,{} });
	REP(i, n) {
		int si = i / B;
		seg[si].o += (a[i] % 2 == 1);
		seg[si].e += (a[i] % 2 == 0);
		seg[si].s += a[i];
	}
	auto apply = [&](int si) {
		const int l = si * B, r = l + B;
		for (const auto& p : seg[si].laz) {
			if (p.first == 0) { // mod
				FOR(i, l, r) (a[i] += p.second) %= 2;
			}
			else { // add
				FOR(i, l, r) a[i] += p.second;
			}
		}
		seg[si].laz = {};
	};

	REP(_, Q) {
		VAR(int, ty, l, r); --l;

		if (ty == 1) {
			for (int i = l; i < r;) {
				int si = i / B;
				if (l <= si * B && (si + 1) * B <= r) {
					seg[si].s = seg[si].o;
					int o = 0;
					for (const auto& p : seg[si].laz) o += p.second;
					seg[si].laz = { PAIR(0, o % 2) };
					i += B;
				}
				else {
					apply(si);
					seg[si].s -= a[i] - a[i] % 2;
					a[i] %= 2;
					++i;
				}
			}
		}
		else if (ty == 2) {
			VAR(int, x);
			for (int i = l; i < r;) {
				int si = i / B;
				if (l <= si * B && (si + 1) * B <= r) {
					if (x & 1) std::swap(seg[si].o, seg[si].e);
					seg[si].s += x * B;
					if (!seg[si].laz.empty() && seg[si].laz.back().first == 1) {
						seg[si].laz.back().second += x;
					}
					else {
						seg[si].laz.emplace_back(1, x);
					}
					i += B;
				}
				else {
					apply(si);
					seg[si].s += x;
					if (x & 1) {
						if (a[i] & 1) --seg[si].o, ++seg[si].e;
						else ++seg[si].o, --seg[si].e;
					}
					a[i] += x;
					++i;
				}
			}
		}
		else {
			int ans = 0;
			for (int i = l; i < r;) {
				int si = i / B;
				if (l <= si * B && (si + 1) * B <= r) {
					ans += seg[si].s;
					i += B;
				}
				else {
					apply(si);
					ans += a[i];
					++i;
				}
			}
			OUT(ans)BR;
		}
	}

	return 0;
}