#ifndef HIDDEN_IN_VS // 折りたたみ用

// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS

// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;

// 型名の短縮
using ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）
using pii = pair<int, int>;	using pll = pair<ll, ll>;	using pil = pair<int, ll>;	using pli = pair<ll, int>;
using vi = vector<int>;		using vvi = vector<vi>;		using vvvi = vector<vvi>;
using vl = vector<ll>;		using vvl = vector<vl>;		using vvvl = vector<vvl>;
using vb = vector<bool>;	using vvb = vector<vb>;		using vvvb = vector<vvb>;
using vc = vector<char>;	using vvc = vector<vc>;		using vvvc = vector<vvc>;
using vd = vector<double>;	using vvd = vector<vd>;		using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;

// 定数の定義
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）
const vi DY = { 0, 1, 0, -1 };
const int INF = 1001001001; const ll INFL = 4004004004004004004LL;
const double EPS = 1e-12; // 許容誤差に応じて調整

// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;

// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define YES(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = ll(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了

// 汎用関数の定義
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }

// 手元環境（Visual Studio）
#ifdef _MSC_VER
#include "local.hpp"
// 提出用（gcc）
#else
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define input_from_file(f)
#define output_to_file(f)
#endif

#endif // 折りたたみ用


//--------------AtCoder 専用--------------
#include <atcoder/all>
using namespace atcoder;

//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);

istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
//----------------------------------------


using S879 = tuple<ll, int, int>; // {和, 偶数の個数, 奇数の個数}
using F879 = tuple<ll, ll, int>; // {a, b, c} : f(x) = c x + (x is even ? a : b)
S879 op879(S879 x, S879 y) {
	ll xs, ys; int x0, x1, y0, y1;
	tie(xs, x0, x1) = x; tie(ys, y0, y1) = y;

	return { xs + ys, x0 + y0, x1 + y1 };
}
S879 e879() { return { 0, 0, 0 }; }
S879 act879(F879 f, S879 x) {
	ll xs, fa, fb; int x0, x1, fc;
	tie(xs, x0, x1) = x; tie(fa, fb, fc) = f;

	ll s; int c0, c1;
	if (fc == 0) {
		s = fa * x0 + fb * x1;
		c0 = (int)(fa % 2 == 0) * x0 + (int)(fb % 2 == 0) * x1;
		c1 = (int)(fa % 2 == 1) * x0 + (int)(fb % 2 == 1) * x1;
	}
	else {
		s = xs + fa * x0 + fb * x1;
		c0 = (int)(fa % 2 == 0) * x0 + (int)(fb % 2 == 1) * x1;
		c1 = (int)(fa % 2 == 1) * x0 + (int)(fb % 2 == 0) * x1;
	}

	return { s, c0, c1 };
}
F879 comp879(F879 f, F879 g) {
	// f(x) = fc x + (x is even ? fa : fb)
	// g(x) = gc x + (x is even ? ga : gb)

	// (fc, gc) = (0, 0) のとき：
	// x が偶数のとき，
	//		f(g(x))
	//		= f(ga)
	//		= ga is even ? fa : fb
	// x が奇数のとき，
	//		f(g(x))
	//		= f(gb)
	//		= gb is even ? fa : fb
	// まとめて
	//		f(g(x)) = x is even ? (ga is even ? fa : fb) : (gb is even ? fa : fb)

	// (fc, gc) = (0, 1) のとき：
	// x が偶数のとき，
	//		f(g(x))
	//		= f(x + ga)
	//		= x + ga is even ? fa : fb
	//		= ga is even ? fa : fb
	// x が奇数のとき，
	//		f(g(x))
	//		= f(x + gb)
	//		= x + gb is even ? fa : fb
	//		= gb is even ? fb : fa
	// まとめて
	//		f(g(x)) = x is even ? (ga is even ? fa : fb) : (gb is even ? fb : fa)

	// (fc, gc) = (1, 0) のとき：
	// x が偶数のとき，
	//		f(g(x))
	//		= f(ga)
	//		= ga + (ga is even ? fa : fb)
	// x が奇数のとき，
	//		f(g(x))
	//		= f(gb)
	//		= gb + (gb is even ? fa : fb)
	// まとめて
	//		f(g(x)) = x is even ? ga + (ga is even ? fa : fb) : gb + (gb is even ? fa : fb)

	// (fc, gc) = (1, 1) のとき：
	// x が偶数のとき，
	//		f(g(x))
	//		= f(x + ga)
	//		= x + ga + (x + ga is even ? fa : fb)
	//		= x + ga + (ga is even ? fa : fb)
	// x が奇数のとき，
	//		f(g(x))
	//		= f(x + gb)
	//		= x + gb + (x + gb is even ? fa : fb)
	//		= x + gb + (gb is even ? fb : fa)
	// まとめて
	//		f(g(x)) = x + (x is even ? ga + (ga is even ? fa : fb) : gb + (gb is even ? fb : fa))

	ll fa, fb, ga, gb; int fc, gc;
	tie(fa, fb, fc) = f; tie(ga, gb, gc) = g;

	ll a, b; int c;
	if (fc == 0 && gc == 0) {
		a = (ga % 2 == 0 ? fa : fb);
		b = (gb % 2 == 0 ? fa : fb);
		c = 0;
	}
	else if (fc == 0 && gc == 1) {
		a = (ga % 2 == 0 ? fa : fb);
		b = (gb % 2 == 0 ? fb : fa);
		c = 0;
	}
	else if (fc == 1 && gc == 0) {
		a = ga + (ga % 2 == 0 ? fa : fb);
		b = gb + (gb % 2 == 0 ? fa : fb);
		c = 0;
	}
	else {
		a = ga + (ga % 2 == 0 ? fa : fb);
		b = gb + (gb % 2 == 0 ? fb : fa);
		c = 1;
	}

	return { a, b, c };
}
F879 id879() { return { 0, 0, 1 }; }
#define yukicoder222E_amonoid S879, op879, e879, F879, act879, comp879, id879


int main() {
//	input_from_file("input.txt");
//	output_to_file("output.txt");

	int n, q;
	cin >> n >> q;

	vector<S879> a(n);
	rep(i, n) {
		ll v;
		cin >> v;

		a[i] = S879{ v, (int)(v % 2 == 0), (int)(v % 2 == 1)};
	}
	lazy_segtree<yukicoder222E_amonoid> seg(a);
	dump(seg);

	rep(hoge, q) {
		int c, l, r;
		cin >> c >> l >> r;
		l--;

		if (c == 1) {
			seg.apply(l, r, F879{ 0, 1, 0 });
		}
		else if (c == 2) {
			ll x;
			cin >> x;

			seg.apply(l, r, F879{ x, x, 1 });
		}
		else {
			cout << get<0>(seg.prod(l, r)) << endl;
		}

		dump(seg);
	}
}