#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

#define REP(i,a,b) for(int i=(a),i##_end_=(b);i<i##_end_;++i)

static const int M=100003;
static const int MM=400003;
static const int Mod=998244353;
int n,q,A[M];
int MX[MM],MN[MM];
__int128 S1[MM],S2[MM],PW[MM];
#define lp p<<1
#define rp p<<1|1
#define lson l,m,lp
#define rson m+1,r,rp
void Build(int l,int r,int p){
  if(l==r){
    S1[p]=MN[p]=MX[p]=A[l];
    S2[p]=1ll*A[l]*A[l];
    return;
  }
  int m=l+r>>1;
  Build(lson);
  Build(rson);
  S1[p]=S1[lp]+S1[rp];
  S2[p]=S2[lp]+S2[rp];
  MN[p]=min(MN[lp],MN[rp]);
  MX[p]=max(MX[lp],MX[rp]);
}
int mn,mx;
__int128 s1,s2;
void Query(int l,int r,int p,int a,int b){
  if(r<a || l>b)return;
  if(a<=l&&r<=b){
    s1+=S1[p];s2+=S2[p];
    mn=min(mn,MN[p]);
    mx=max(mx,MX[p]);
    return;
  }
  int m=l+r>>1;
  Query(lson,a,b);
  Query(rson,a,b);
}
void Modify(int l,int r,int p,int a,int b){
  if(l==r){
    MN[p]=MX[p]=S1[p]=b;
    S2[p]=1ll*b*b;
    return;
  }
  int m=l+r>>1;
  if(a<=m)Modify(lson,a,b);
  else Modify(rson,a,b);
  S1[p]=S1[lp]+S1[rp];
  S2[p]=S2[lp]+S2[rp];
  MN[p]=min(MN[lp],MN[rp]);
  MX[p]=max(MX[lp],MX[rp]);
}
int main(){
  REP(i,1,MM)PW[i]=PW[i-1]+1ll*i*i;

  scanf("%d%d",&n,&q);
  REP(i,1,n+1){
    int a;
    scanf("%d",&a);
    A[i]=a;
  }
  Build(1,n,1);

  while(q--){
    int op,x,y;
    scanf("%d%d%d",&op,&x,&y);
    if(op==1)Modify(1,n,1,x,y);
    else{
      if(x==y){puts("YES");continue;}
      mn=1e9+3,mx=-1;
      s1=s2=0;
      Query(1,n,1,x,y);
      if((mx-mn)%(y-x)){puts("NO");continue;}
      long long t=y-x+1,d=(mx-mn)/(t-1);
      //cout<<mn<<','<<mx<<','<<t<<','<<d<<endl;
      __int128 ts1=((__int128)t)*(mn+mx)>>1;
      __int128 ts2=((__int128)t)*mn*mn+PW[t-1]*d*d+((__int128)((2*t-2)*t>>1))*mn*d;
      //cout<<((int)ts1)<<','<<((int)ts2)<<','<<((int)s1)<<','<<((int)s2)<<endl;
      if(ts1!=s1 || ts2!=s2)puts("NO");
      else puts("YES");
    }
  }

  return 0;
}