#include<bits/stdc++.h>
using namespace std;
#define pc putchar_unlocked
#define gc getchar_unlocked
typedef long long ll;
typedef unsigned long long llu;
#define mp make_pair
#define pb push_back
#define sc(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define sc3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define scl(x) scanf("%lld",&x)
#define scl2(x,y) scanf("%lld%lld",&x,&y)
#define scl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define scstr(x) scanf("%s",x)
#define pd(x) printf("%d",x)
#define pstr(x) printf("%s",x)
#define newl() printf("\n")
#define fl(i,n) for (i=0;i<n;i++)
#define fle(i,n) for (i=1;i<=n;i++)
#define fla(i,a,n) for (i=a;i<n;i++)
#define mem(a,i) memset(a,i,sizeof(a))
#define fi first
#define se second
typedef pair<int,int> pii;
typedef pair<int,pair<int,int> > piii ;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
#define gcd __gcd
#define wl(n) while (n--)
#define debug(x) cerr<<"debug->"<<#x<<"::"<<x<<endl
#define debug2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n"
#define debug3(x,y,z) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n"
#define tr(container, it)  for(typeof(container.begin()) it = container.begin(); it != container.end(); it++) 
#define all(v) v.begin(),v.end()
#define tatt(cont) typeof(cont.begin())
const double eps=0.000000000000001 ;
#define MOD 1000000007
typedef long double LF;
typedef double lF;
#define hihihaha ((double)CLOCKS_PER_SEC)
#define nl putchar('\n')
#define X(x) ((x)%MOD)
//-------------
ll powd(ll a, ll b, ll c)
{
	if (b==0)
		return 1;
	ll ret=powd(a,b/2,c);
	if (b&1)
		return (((a*ret)%c)*ret)%c;
	else
		return (ret*ret)%c;
}// a^b mod c is calculated by this.. 
ll tree[4*100010];
ll inva,invb,n,a,b,q;
ll C[100010];
void btree(int nod,int a,int b)
{
	if(a==b)
	{
		tree[nod]=X(X(X(C[a]*powd(inva,a+1,MOD))*powd(b,a,MOD))*(a%2==0?1:-1));
		return ;
	}
	int mid=(a+b)>>1,lc=(nod<<1),rc=(lc+1);
	btree(lc,a,mid);
	btree(rc,mid+1,b);
	tree[nod]=X(tree[lc]+tree[rc]);
}	
int lo,hi;
ll que(int nod ,int a,int b){
	if(a>b||b<lo||hi<a)
		return 0;
	int mid=(a+b)>>1,lc=(nod<<1),rc=(lc+1);
	if (lo<=a&&b<=hi)
		return tree[nod];
	ll xx=que(lc,a,mid);
	ll yy=que(rc,mid+1,b);
	return X(xx+yy);
}
void upd(int nod,int a,int b,int ind)
{
	if (a==b)
	{

		assert(a==ind);
		tree[nod]=X(X(X(C[a]*powd(inva,a+1,MOD))*powd(b,a,MOD))*(a%2==0?1:-1));
		return ;
	}
	int mid=(a+b)>>1,lc=(nod<<1),rc=(lc+1);
	if (ind<=mid)
		upd(lc,a,mid,ind);
	else 
		upd(rc,mid+1,b,ind);
	tree[nod]=X(tree[lc]+tree[rc]);
}
int main()
{	//ios::sync_with_stdio(0), cin.tie(0);
	scl3(n,a,b);
	scl(q);
	inva=powd(a,MOD-2,MOD);
	invb=powd(b,MOD-2,MOD);	
	int i;	
	for (i=0;i<n;i++)
		scl(C[i]);
	wl(q)
	{
		int typ;
		sc(typ);
		if(typ==1)
		{
			int x,y;
			sc2(x,y);
			C[x]=y;
			upd(1,0,n-1,x);
		}
		else 
		{
			int x,y;
			sc2(x,y);
			lo=x;
			hi=y;
			ll got=que(1,0,n-1);
			ll lol=powd((1LL*a*invb)%MOD,x,MOD);
			got=X(got*lol);
			if(x%2==1)
			{
				got*=-1;
			}
			got=(got%MOD+MOD)%MOD;
			got=(b*got)%MOD;
			if (got==(C[x]%MOD+MOD)%MOD){
				printf("Yes\n");
			}
			else 
				printf("No\n");

		}
	}

	return 0;

}


//01010110 01101100 01100001 01100100 00101110