#include <bits/stdc++.h>
using namespace std;
#define maxn 100010
const int mod= 1e9 + 7;
#define maxn 100010
#define mid (L+R)/2
#define mp make_pair
#define pii pair<long long int,int>
#define F first
#define S second
long long int modpow (int base, int exp){
	if (exp==1) return base;
	if (exp==0) return 1LL;
	long long int prev= modpow(base, exp/2);
	prev= prev*prev%mod;
	if (exp%2) prev= base*prev%mod;
	return prev;
}

long long int pre[maxn], a[maxn];

void init(long long int val){
	pre[0]= 1LL;
	for (int i=1; i<maxn; i++) pre[i]= val*pre[i-1]%mod;
}

long long int modinv (int base){
	return modpow(base, mod-2);
}

long long int st[4*maxn+10];

void build (int N, int L, int R){
	if (L>R) return;
	if (L==R){
		st[N]= a[L];

		return;
	}
	build (2*N+1, L, mid);
	build (2*N+2, mid+1, R);
	st[N]= (st[2*N+1]+1LL*(pre[mid-L+1])*st[2*N+2])%mod;

}

void upd (int N, int L, int R, int ind, int val){
	if (L>R) return;
    if (L==R){
    	st[N]= val;
    	return;
    }
    if (ind<=mid) upd (2*N+1, L, mid, ind, val);
    else upd (2*N+2, mid+1, R, ind, val);
	st[N]= (st[2*N+1]+1LL*(pre[mid-L+1])*st[2*N+2])%mod;
}

pii query (int N, int L, int R, int S, int E){
	if (L>R or L>E or S>R) return mp(0, 0);
	if (L>=S and R<=E) {
	//	cout<<"ret "<<N<<" ? "<<L<<" "<<R<<" "<<S<<" "<<E<<" : "<<st[N]<<endl;
		return mp(st[N], R-L+1);
	}
	pii f= query(2*N+1, L, mid, S, E), l= query(2*N+2, mid+1, R, S, E);
	long long int val= f.F + 1LL*pre[f.S]*l.F;
	val%=mod;
	//cout<<"ret "<<L<<" "<<R<<" : "<<S<<" "<<E<<" :: "<<val<<endl;
	return mp((int) val, f.S+l.S);
}

int main(){
	int n, q;
	scanf("%d", &n);
	long long int aa, b;
	scanf("%lld %lld", &aa, &b);
	aa= modinv(aa);
	long long int test= aa*b%mod;
	test= -test;
	test%=mod;
	if (test<0) test+=mod;
	scanf("%d", &q);
	init(test);
	if (test<0) test+=mod;
	for (int i=1; i<=n; i++) cin>>a[i];
	build (0, 1, n);
	int t, u, v;
	while (q--)	{
		//cin>>t>>u>>v;
		scanf("%d %d %d", &t, &u, &v);

		if (t==1){
			u++;
			a[u]= v;
			upd (0, 1, n, u, v);
		}
		else{
			u++;
			v++;
			long long int get= query(0, 1, n, u, v).F;
			get%=mod;
			if (get<0) get+=mod;
			if (get==0){
				//cout<<"Yes"<<endl;
				printf("Yes \n");
			}
			else{
				//cout<<"No"<<endl;
				printf("No \n");
			}
		}

	}
}