#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

template<typename Monoid>
struct SegmentTree{
    using F=function<Monoid(Monoid,Monoid)>;
    int sz;
    vector<Monoid> seg;
    const F f;
    const Monoid gen;
    SegmentTree(int n,const F f,const Monoid &gen):f(f),gen(gen){
        sz=1;
        while(sz<n)sz<<=1;
        seg.assign(2*sz,gen);
    }
    void set(int k,const Monoid &x){
        seg[k+sz]=x;
    }
    void build(){
        for(int k=sz-1;k>0;k--) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
    void update(int k,const Monoid &x){
        k+=sz;
        seg[k]=x;
        while(k>>=1) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
   // [a,b)
    Monoid query(int a,int b){
        Monoid L=gen,R=gen;
        for(a+=sz,b+=sz;a<b;a>>=1,b>>=1){
            if(a&1) L=f(L,seg[a++]);
            if(b&1) R=f(seg[--b],R);
        }
        return f(L,R);
    }
    Monoid operator[](const int &k)const {
       return seg[k+sz];
    }
};


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n,q;cin>>n>>q;
    vector<ll> a(n),b(n-1);
    rep(i,n) cin>>a[i];
    rep(i,n-1){
        b[i]=a[i]-a[i+1];
    }

    SegmentTree<int> seg(n-1,[](int a,int b){return a+b;},0);
    rep(i,n-1){
        if(b[i]==0) seg.set(i,0);
        else        seg.set(i,1);
    }
    seg.build();
    while(q--){
        int type;cin>>type;
        if(type==1){
            int l,r;ll x;cin>>l>>r>>x;l--,r--;
            if(l){
                ll re=b[l-1]-x;
                if(re==0 and b[l-1]!=0) seg.update(l-1,0);
                if(re!=0 and b[l-1]==0) seg.update(l-1,1);
                b[l-1]=re;
            }
            if(r<n-1){
                ll re=b[r]+x;
                if(re==0 and b[r]!=0) seg.update(r,0);
                if(re!=0 and b[r]==0) seg.update(r,1);
                b[r]=re;
            }
        }else{
            int l,r;cin>>l>>r;l--,r--;
            cout<<seg.query(l,r)+1<<endl;
        }
        // cout<<"B : ";
        // rep(i,n-1) cout<<seg[i]<<" ";cout<<endl;
        // debug(b);
    }

    return 0;
}