#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;
const int nmax = 500001;
struct node{
ll x, y;
ll pr, suf;
ll sum, lazy, lazy1;
bool good = false;
ll ans = 0;
node(){
x = y = 0;
pr = suf = 0;
sum = lazy1 = 0;
lazy = -1e18;
ans = 0;
}
}t[4 * nmax];
node merg(node a, node b){
node c;
c.sum = a.sum + b.sum;
c.pr = a.pr;
c.suf = b.suf;
c.x = a.x;
c.y = b.y;
if(a.good){
if(b.x == a.x) c.pr += b.pr;
}
if(b.good){
if(a.y == b.y) c.suf += a.suf;
}
if(a.good && b.good && a.x == b.x)
c.good = true;
c.ans = max(a.ans, b.ans);
if(a.y == b.x){
c.ans = max(c.ans, a.suf + b.pr);
}
return c;
}
//lazy minichebis lazy1 damatebis
void push1(int v, int l, int r){
if(t[v].lazy == -1e18)return;
t[v * 2].lazy = t[v].lazy;
t[v * 2].lazy1 = -1e18;
t[v * 2 + 1].lazy = t[v].lazy;
t[v * 2 + 1].lazy1 = -1e18;
int m = (l + r) /2;
t[v * 2].sum = (ll)(m - l + 1) * t[v].lazy;
t[v * 2 + 1].sum = (ll)(r - m) * t[v].lazy;
t[v * 2].good = true;
t[v * 2].pr = t[v * 2].suf = m - l + 1;
t[v * 2].x = t[v * 2].y = t[v].lazy;
t[v * 2 + 1].good = true;
t[v * 2 + 1].pr = t[v * 2 + 1].suf = r - m;
t[v * 2 + 1].x = t[v * 2 + 1].y = t[v].lazy;
t[v].lazy = -1e18;
}
void push2(int v, int l, int r){
if(t[v].lazy1 == 0) return;
ll m = (l + r) / 2;
if(t[v * 2].lazy != -1e18) t[v * 2].lazy += t[v].lazy1;
if(t[v * 2 + 1].lazy != -1e18) t[v * 2 + 1].lazy += t[v].lazy1;
t[v * 2].lazy1 += t[v].lazy1;
t[v * 2 + 1].lazy1 += t[v].lazy1;
t[v * 2].x += t[v].lazy1;
t[v * 2].y += t[v].lazy1;
t[v * 2 + 1].x += t[v].lazy1;
t[v * 2 + 1].y += t[v].lazy1;
t[v * 2].sum += t[v].lazy1 * (ll)(m - l + 1);
t[v * 2 + 1].sum += t[v].lazy1 * (ll)(r - m);
t[v].lazy1 = 0;
}
void updran1(int v, int l, int r, int st, int fin, ll val){//minicheba intervalze
if(l > fin || r < st)
return;
if(l >= st && r <= fin){
t[v].sum = val * (ll)(r - l + 1);
t[v].x = t[v].y = val;
t[v].pr = t[v].suf = r - l + 1;
t[v].lazy = val;
t[v].lazy1 = 0;
t[v].good = true;
return;
}
push1(v, l, r);
push2(v, l, r);
int m = (l + r) / 2;
updran1(2 * v, l, m, st, fin, val);
updran1(2 * v + 1, m + 1, r, st, fin, val);
t[v] = merg(t[2 * v], t[2 * v + 1]);
}
void updran2(int v, int l, int r, int st, int fin, ll val){
if(l > fin || r < st)
return;
if(l >= st && r <= fin){
t[v].sum += val * (ll)(r - l + 1);
t[v].x += val;
t[v].y += val;
if(t[v].lazy != -1e18) t[v].lazy += val;
t[v].lazy1 += val;
return;
}
push1(v, l, r);
push2(v, l, r);
int m = (l + r) / 2;
updran2(2 * v, l, m, st, fin, val);
updran2(2 * v + 1, m + 1, r, st, fin, val);
t[v] = merg(t[2 * v], t[2 * v + 1]);
}
void upd_p(int v, int l, int r, int pos, ll val){
if(l > pos || r < pos){
return;
}
if(l == r){
t[v].sum = val;
t[v].x = t[v].y = val;
t[v].lazy = -1e18;
t[v].lazy1 = 0;
t[v].pr = t[v].suf = 1;
t[v].ans = 1;
t[v].good = true;
return;
}
push1(v, l, r);
push2(v, l, r);
int m = (l + r) / 2;
upd_p(2 * v, l, m, pos, val);
upd_p(2 * v + 1, m + 1, r, pos, val);
t[v] = merg(t[2 * v], t[2 * v + 1]);
}
ll getsum(int v, int l, int r, int st, int fin){
if(l > fin || r < st)
return 0;
if(l >= st && r <= fin)
return t[v].sum;
push1(v, l, r);
push2(v, l, r);
int m = (l + r) / 2;
return getsum(2 * v, l, m,st, fin) + getsum(2 * v + 1, m + 1, r, st, fin);
}
node getans(int v, int l, int r, int tl, int tr){
if(l == tl && r == tr){
return t[v];
}
push1(v, l, r);
push2(v, l, r);
int m = (l + r) / 2;
if(tl > m)
return getans(2 * v + 1, m + 1, r, tl, tr);
if(tr <= m)
return getans(2 * v, l, m, tl, tr);
return merg(getans(2 * v, l, m, tl, m), getans(2 * v + 1, m + 1, r, m + 1, tr));
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n, q; cin >> n >> q;
ll a[n + 1];
for(int i = 1; i<= n; ++i){
cin >> a[i];
}
for(int i = 2; i <= n; i++){
upd_p(1, 1, n, i - 1, a[i] - a[i - 1]);
}
while(q--){
int t; cin >> t;
if(t == 3){
int l, r; cin >> l >> r;
if(l == r) cout << 1 << "\n";
else
cout << getans(1, 1, n, l, r - 1).ans + 1 << "\n";
}
if(t == 1){
ll l, r, s, c; cin >> l >> r >> s >> c;
if(l > 1){
ll x = getsum(1, 1, n, l - 1, l - 1);
upd_p(1, 1, n, l - 1, s + x);
}
else a[1] += s;
updran2(1,1, n, l, r - 1, c);
ll val = s + c * (r - l);
val = -val + getsum(1, 1, n, r, r);
if(r != n)upd_p(1, 1, n, r, val);
}
if(t == 2){
ll l, r, s, c; cin >> l >> r >> s >> c;
ll x = getsum(1, 1, n, 1, l - 2) + a[1];
ll y = getsum(1, 1, n, 1, r) + a[1];
if(l > 1){
upd_p(1, 1, n, l - 1, s - x);
}
if(r < n){
x = y;
upd_p(1, 1, n, r, x - s - (r - l) * c);
}
if(l == 1){
a[1] = s;
}
updran1(1, 1, n, l, r - 1, c);
}
}
return 0;
}
