#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

class LazySegmentTree{
private:
  int n;
  vector<ll> node,lazy;

public:
  LazySegmentTree(vector<ll> v){
      n=1;
      while(n<v.size()) n*=2;
      node.resize(2*n-1,0);
      lazy.resize(2*n-1,0);
      
      for(int i=0;i<v.size();i++) node[i+n-1]=v[i];
      for(int i=n-2;i>=0;i--) node[i]=node[2*i+1]+node[2*i+2];
  }

  void eval(int k,int l,int r){
      if(lazy[k]!=0){
          node[k]+=lazy[k];
          if(r-l>1){
              lazy[2*k+1]+=lazy[k]/2;
              lazy[2*k+2]+=lazy[k]/2;
          }
          lazy[k]=0;
      }
  }

  void add(int a,int b,ll x,int k=0,int l=0,int r=-1){
      if(r<0) r=n;
      eval(k,l,r);
      if(b<=l||r<=a) return;
      if(a<=l&&r<=b){
          lazy[k]+=(r-l)*x;
          eval(k,l,r);
      }else{
          add(a,b,x,2*k+1,l,(r+l)/2);
          add(a,b,x,2*k+2,(r+l)/2,r);
          node[k]=node[2*k+1]+node[2*k+2];
      }
  }

  ll getSum(int a,int b,int k=0,int l=0,int r=-1){
      if(r<0) r=n;
      eval(k,l,r);
      if(b<=l||r<=a) return 0;
      if(a<=l&&r<=b) return node[k];

      ll vl,vr;
      vl=getSum(a,b,2*k+1,l,(l+r)/2);
      vr=getSum(a,b,2*k+2,(l+r)/2,r);
      return vl+vr;
  }
};

int N,Q;
vector<ll> A;
vector<ll> T,L,R,X;

int main(){
  cin>>N>>Q;
  A.resize(N);
  rep(i,N) cin>>A[i];
  L.resize(Q);
  R.resize(Q);
  T.resize(Q);
  X.resize(Q,0);
  rep(i,Q){
    cin>>T[i];
    if(T[i]==1) cin>>L[i]>>R[i]>>X[i];
    else cin>>L[i]>>R[i];
    L[i]--;R[i]--;
  }

  vector<ll> v(N,0);
  for(int i=0;i+1<N;i++) if(A[i]!=A[i+1]) v[i]=1;

  LazySegmentTree val(A),ind(v);
  for(int i=0;i<Q;i++){
    if(T[i]==1){
      ll prel=0,prea=0;
      ll prer=0,preb=0;
      if(L[i]-1>=0){
        prel=val.getSum(L[i],L[i]+1);
        prea=val.getSum(L[i]-1,L[i]);

        if(prel==prea) ind.add(L[i]-1,L[i],1);
        else if(prel!=prea&&prea==prel+X[i]) ind.add(L[i]-1,L[i],-1);
      }
      if(R[i]+1<N){
        prer=val.getSum(R[i],R[i]+1);
        preb=val.getSum(R[i]+1,R[i]+2);
        if(prer==preb) ind.add(R[i],R[i]+1,1);
        else if(prer!=preb&&preb==prer+X[i]) ind.add(R[i],R[i]+1,-1);
      }

      val.add(L[i],R[i]+1,X[i]);
    }else{
      int ans=ind.getSum(L[i],R[i])+1;
      cout<<ans<<endl;
    }
  }

  return 0;
}