#include<bits/stdc++.h>
using namespace std;
 
#define sd(mark) scanf("%d",&mark)
#define ss(mark) scanf("%s",mark)
#define sl(mark) scanf("%lld",&mark)
#define debug(mark) printf("check%d\n",mark)
#define clr(mark) memset(mark,0,sizeof(mark))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ll long long
#define N 100010
#define mod 1000000007
ll bit[N];
ll val[N];
ll K;

ll c[N];

ll pow1(ll a,ll b)
{
	if(b==0)	return 1;
	ll ret=pow1(a,b/2);
	ret=(ret*ret)%mod;
	if(b&1)	ret=(a*ret)%mod;
	return ret;
}
void update(int i,ll val)
{
	while(i<N)
	{
		bit[i]=(bit[i]+val)%mod;
		i+=(i&(-i));
	}
}
ll query(int i)
{
	ll ret=0;
	while(i)
	{
		ret=(ret+bit[i])%mod;
		i-=(i&(-i));
	}
	return ret;
}
void update_arr(int i,ll x)
{
	ll diff=(pow1(K,i)*x%mod-val[i]+mod)%mod;
	update(i+1,diff);
	val[i]=pow1(K,i)*x%mod;
	c[i]=x;
}
ll query(int l,int r)
{
	ll val=(query(r+1)-query(l)+mod)%mod;
	ll inv=pow1(K,mod-2);
	return val*pow1(inv,l)%mod;
}
int main()
{
	clr(bit);clr(val);
	int n,q,i;
	ll a,b;
	sd(n);sl(a);sl(b);sd(q);
	K=b*pow1(a,mod-2)%mod;
	K=(mod-K)%mod;
	for(i=0;i<n;i++)
	{
		ll x;
		sl(x);
		update_arr(i,x);
	}
	while(q--)
	{
		int ch,x,y;
		sd(ch);sd(x);sd(y);
		if(ch==1)
			update_arr(x,y);
		else
		{
			if((K!=0 && query(x,y)==0) || (K==0 && c[x]==0))
				printf("Yes\n");
			else
				printf("No\n");
		}
	}
}