/**

   Pradip chandra karmaker
   Comilla University(6th_ICT)
*/



#include<bits/stdc++.h>

using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define clr(a) memset(a,0,sizeof a)
#define neg(a) memset(a,-1,sizeof a)
#define Sort(a) sort(a.begin(),a.end())
#define All(a) a.begin(),a.end()
typedef long long i64;
typedef pair<int,int> pi;
#define mod 1000000007LL



template<class T>T Bitcnt(T a){int sum=0;while(a){if(a&1)sum++;a/=2;}return sum;}
template<class T>T Max3(T a,T b,T c){return max(a,max(b,c));}
template<class T>T Lcm(T a,T b){T tmp=__gcd(a,b);return (a/tmp)*b;}
template<class T> T Pow(T a,T b){T ans=1;T base=a;while(b){if(b&1)ans=(ans*base);base=(base*base);b/=2;}return ans;}


i64 Bigmod(i64 a,i64 b)
{

    i64 res=1;
    i64 pw=a%mod;
    while(b>0)
    {
       if(b&1)res=(res*pw)%mod;
       pw=(pw*pw)%mod;
       b/=2;
    }
    return res;
}


#define s1(a) scanf("%d",&a)
#define s2(a,b) scanf("%d %d",&a,&b)
#define s3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sl1(a) scanf("%lld",&a)
#define sl2(a,b) scanf("%lld %lld",&a,&b)
#define sl3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define p1(a) printf("%d",a)
#define p2(a,b) printf("%d %d",&a,&b)
#define NL printf("\n")
#define N 4000000
#define rep(i,a,b)    for(int i=a;i<=b;i++)
#define rrep(i,b,a)   for(int i=b;i>=a;i--)
#define fs(i,a,s)     for(int i=a;s[i];i++)

int a_x[]={1,-1,0,0};
int a_y[]={0,0,1,-1};
i64 X,Y;

void extend_euclid(i64 a,i64 b)
{
    if(b==0)
    {
        X=1;Y=0;return;
    }
    extend_euclid(b,a%b);
    i64 x,y;
    x=Y;
    y=X-(a/b)*Y;
    X=x;
    Y=y;
}



i64 inverse_modulo(i64 a,i64 b)
{
    extend_euclid(a,b);
    return (X+mod)%mod;
}


/** dijkstra,bitmask,ME,scc,backtracking,grid dp,segment tree,bit,LCA,bfs,dfs,BPM,MAX_FLOW,MCM,Tree dp,kmp,MST,Meet in the middle*/

/**Triangle characteristics,Phi,bitwise_seive,SOD,articulation,topological,HLD,Z,knapsack,Coin,Digit,LIS,LCS,minimum vertex
cover,josephus,chinese remainder,square root decomposition,ternary search,binary search,Number of theory(divisor,prime),chinese remainder,Generic functoin,Convex hull*/

/*************************************************************************************************************************************************************************************************/



i64 pw[200005];

i64 tree[5*100005];
int arr[200005];


void build(int node,int b,int e)
{
    if(b==e)
    {
        tree[node]=(arr[b]*pw[b-1])%mod;
        return;
    }

    int mid=(b+e)/2;
    build(node*2,b,mid);
    build(node*2+1,mid+1,e);
    tree[node]=(tree[node*2]+tree[node*2+1])%mod;
}

void update(int node,int b,int e,int indx,int val)
{
    if(b==e)
    {
        tree[node]=(val*1LL*pw[b-1])%mod;
        return;
    }

    int mid=(b+e)/2;
    if(indx<=mid)
        update(node*2,b,mid,indx,val);
     else update(node*2+1,mid+1,e,indx,val);
     tree[node]=(tree[node*2]+tree[node*2+1])%mod;
}

i64 query(int node,int b,int e,int i,int j)
{
    if(e<i || j<b)
        return 0;
     if(i<=b && e<=j)
     {
         return tree[node];
     }
     int mid=(b+e)/2;
     i64 C=query(node*2,b,mid,i,j);
     i64 D=query(node*2+1,mid+1,e,i,j);
     return (C+D)%mod;

}
int main()
{
      int n;
      s1(n);
      int a,b,q;
      s3(a,b,q);
     rep(i,1,n)s1(arr[i]);
     pw[0]=1;
     int x=37;
     i64 Base=2*x+b;
      Base%=mod;
     for(int i=1;i<=n;i++)
     {
         pw[i]=(pw[i-1]*x)%mod;

     }

     build(1,1,n);
     while(q--)
     {
         int type;
         s1(type);
         if(type==1)
         {
            int indx,val;
            s2(indx,val);
            update(1,1,n,indx+1,val);
         }
         else if(type==2)
         {
              int l,r;
              s2(l,r);
              l++;r++;
              i64 res=query(1,1,n,l,r);
              i64 tmp=(l-1);
              tmp=pw[tmp];
              tmp=Bigmod(tmp,mod-2);
              res=(res*tmp)%mod;
            //  cout<<res<<endl;
             if(res==0 || res==Base)
             {
                 puts("Yes");
             }
             else
             {
                    if(res%Base==0)
                    {
                        puts("Yes");
                    }
                    else puts("No");
             }
         }
     }
    return 0;
}