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

long long C[100005];

long long fast(long long a,long long b)
{
	long long ans = 1;
	while(b!=0)
	{
		if(b%2==1) ans = (ans*a)%mod;
		a=(a*a)%mod;
		b/=2;
	}
	return ans;
}

int main()
{
	long long n,a,b,q;
	scanf("%lld %lld %lld %lld",&n,&a,&b,&q);
	for(int c=0;c<n;c++) scanf("%lld",&C[c]);
	long long multi = b * fast(a,mod-2);
	multi = -1*multi;
	multi = (multi % mod + mod)%mod;
	for(int c=0;c<q;c++)
	{
		long long t,l,r;
		scanf("%lld %lld %lld",&t,&l,&r);
		if(t==1) C[l] = r;
		else
		{
			long long tp = 1;
			long long cp = 0;
			for(int c=l;c<=r;c++)
			{
				cp = (cp+C[c]*tp)%mod;
				tp = (tp*multi)%mod;
			}
			if(cp==0) printf("Yes\n");
			else printf("No\n");
		}
	}
}