#include <bits/stdc++.h>
using namespace std;


const double EPS = 1e-9;
const int INF = 0x7f7f7f7f;
const double PI=acos(-1.0);

#define    READ(f) 	         freopen(f, "r", stdin)
#define    WRITE(f)   	     freopen(f, "w", stdout)

#define    m_p(x, y) 	     make_pair(x, y)
#define    p_b(x)             push_back(x)

#define    rep(i,n)         for(i=1;i<=n;i++)
#define    rep0(i,n)         for(i=0;i<n;i++)


#define    SET(p) 	         memset(p, -1, sizeof(p))
#define    CLR(p)            memset(p, 0, sizeof(p))
#define    MEM(p, v)         memset(p, v, sizeof(p))
#define    CPY(d, s)         memcpy(d, s, sizeof(s))

#define    getI(a) 	         scanf("%d", &a)
#define    getII(a,b) 	     scanf("%d%d", &a, &b)
#define    getIII(a,b,c)     scanf("%d%d%d", &a, &b, &c)
#define    getL(a)           scanf("%lld",&a)
#define    getLL(a,b)        scanf("%lld%lld",&a,&b)
#define    getLLL(a,b,c)     scanf("%lld%lld%lld",&a,&b,&c)
#define    getC(n)           scanf("%c",&n)
#define    getF(n)           scanf("%lf",&n)
#define    getS(n)           scanf("%s",n)

#define    vi 	 vector < int >
#define    vii 	 vector < vector < int > >
#define    pii 	 pair< int, int >
#define    ff 	 first
#define    ss 	 second
#define    ll	 long long
#define    ull 	 unsigned long long
#define    ui    unsigned int

#define    MOD   1000000007


template< class T > inline T _abs(T n) { return ((n) < 0 ? -(n) : (n)); }
template< class T > inline T _max(T a, T b) { return (!((a)<(b))?(a):(b)); }
template< class T > inline T _min(T a, T b) { return (((a)<(b))?(a):(b)); }
template< class T > inline T _swap(T &a, T &b) { a=a^b;b=a^b;a=a^b;}
template< class T > inline T gcd(T a, T b) { return (b) == 0 ? (a) : gcd((b), ((a) % (b))); }
template< class T > inline T lcm(T a, T b) { return ((a) / gcd((a), (b)) * (b)); }


//******************DELETE****************

#ifdef rafsan_rana
     #define debug(args...) {cerr<<"Debug: "; dbg,args; cerr<<endl;}
#else
    #define debug(args...)  // Just strip off all debug tokens
#endif

struct debugger{
    template<typename T> debugger& operator , (const T& v){
        cerr<<v<<" ";
        return *this;
    }
}dbg;

int bitOn(int N,int pos)
{
    return N=N | (1<<pos);
}
int bitOff(int N,int pos)
{
    return N=N & ~(1<<pos);
}
bool bitCheck(int N,int pos)
{
    return (bool)(N & (1<<pos));
}



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





#define SIZE 100100

int arr[SIZE];

struct node {
    int val;

}tnode[4*SIZE];

void build ( ll t, ll l, ll r ) {
    ll m = ( l + r ) / 2;
    ll u = t * 2;
    ll v = u + 1;

    if ( l == r ) {
        /// This is a leaf
        tnode[t].val = arr[l];
        return;
    }

    build ( u, l, m );
    build ( v, m + 1, r );

    tnode[t].val = tnode[u].val + tnode[v].val;
}




ll updatePos, updateVal;
void update ( ll t, ll l, ll r )
 {
    ll m = ( l + r ) / 2;
    ll u = t * 2;
    ll v = u + 1;

    if ( l == r )
    {
        ///This is base case. This will always be p
        tnode[t].val = updateVal;
        return;
    }

    if
    (
      updatePos <= m ) {
        ///Go left
        update ( u, l, m );
    }
    else
    {
        ///Go right
        update ( v, m + 1, r );
    }

    tnode[t].val = tnode[u].val + tnode[v].val;
}

ll queryRes, queryLeft, queryRight;
void query ( ll t, ll l, ll r ) {
    ll m = ( l + r ) / 2;
    ll u = t * 2;
    ll v = u + 1;

    if ( r < queryLeft || queryRight < l ) {
        ///Disjoint
        return;
    }

    if ( queryLeft <= l && r <= queryRight ) {
        queryRes += tnode[t].val;
        return;
    }

    query ( u, l, m );
    query ( v, m + 1, r );
}


int main()
{
    ll n,a,b,q;
    cin>>n>>a>>b>>q;
    ll vag=a+b;
    for(ll i=1;i<=n;i++)
        cin>>arr[i];
    build(1,1,n);
    for(ll i=1;i<=q;i++)
    {
        int p;
        cin>>p;
        if(p==1)
        {
            cin>>updatePos>>updateVal;
            updatePos++;
            update ( 1,1,n );
        }
        else
        {
            cin>>queryLeft>>queryRight;
            queryLeft++;
            queryRight++;
            queryRes=0;
            query ( 1, 1, n );
            if(queryRes%vag==0)
                cout<<"Yes";
            else
                cout<<"No";
            if(i!=q)cout<<endl;
        }
    }

}