#pragma GCC optimize("O3", "unroll-loops") // "Ofast"
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;
int n, q, a[N];
void solve () {
cin >> n >> q;
for (int i = 1; i <= n; i++) cin >> a[i];
while (q--) {
int tp, l, r, s, c;
cin >> tp >> l >> r;
if (tp == 1) {
cin >> s >> c;
for (int i = l; i <= r; i++) a[i] += (s + (i - l) * c);
}
if (tp == 2) {
cin >> s >> c;
for (int i = l; i <= r; i++) a[i] = (s + (i - l) * c);
}
if (tp == 3) {
if (l == r) {
cout << "1\n";
continue;
}
int ans = 1, cur = 1, k = a[l + 1] - a[l];
for (int i = l; i < r; i++) {
if (a[i + 1] - a[i] == k) cur++;
else {
k = a[i + 1] - a[i];
ans = max(ans, cur);
cur = 2;
}
}
ans = max(ans, cur);
cout << ans << '\n';
}
}
cout << '\n';
}
bool testcases = 0;
signed main() {
#ifdef ONLINE_JUDGE
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
