#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)



typedef long long ll;
#define MOD 1000000007
const int NUM_FAC = 2000001;
ll modfact(ll x) {
	static ll _fact[NUM_FAC + 1];
	if (_fact[0] == 0) {
		_fact[0] = 1;
		for (int i = 1; i <= NUM_FAC; ++i) _fact[i] = _fact[i - 1] * i%MOD;
	}
	return _fact[x];
}
ll modpow(ll a, ll n) {
	a %= MOD;
	if (a == 0) return 0;
	ll r = 1;
	while (n) r = r*((n % 2) ? a : 1) % MOD, a = a*a%MOD, n >>= 1;
	return r;
}
ll moddiv(ll a, ll b)
{
	ll ap_2 = modpow(b, MOD - 2);
	return (a * ap_2) % MOD;
}
template<class V, int NV> class SegTree {
public:
	static V const def = 0;
	V comp(V l, V r) { return (l + r) % MOD; };

	vector<V> val;
	SegTree() { val = vector<V>(NV * 2, def); }

	V getval(int l, int r) { //[l,r]
		l += NV; r += NV + 1;
		V ret = def;
		while (l < r) {
			if (l & 1) ret = comp(ret, val[l++]);
			if (r & 1) ret = comp(ret, val[--r]);
			l /= 2; r /= 2;
		}
		return ret;
	}
	void update(int i, V v) {
		i += NV;
		val[i] = v;
		while (i>1) i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]);
	}
};
//-----------------------------------------------------------------
int N, Q;
ll A, B;
ll C[101010];
//-----------------------------------------------------------------
SegTree<ll, 1 << 20> st;
int main() {
	cin >> N >> A >> B >> Q;
	rep(i, 0, N) scanf("%lld", &C[i]);

	ll x = moddiv((MOD - B), A);
	rep(i, 0, N) {
		st.update(i, (C[i] * modpow(x, i)) % MOD);
	}

	rep(i, 0, Q) {
		int q; scanf("%d", &q);

		if (q == 1) {
			int j; scanf("%d", &j);
			ll y; scanf("%lld", &y);
			st.update(j, y * modpow(x, j));
		}
		else {
			int l, r; scanf("%d %d", &l, &r);

			ll a = st.getval(l, r);
			a = moddiv(a, modpow(x, l));
			if (a == 0)
				printf("Yes\n");
			else
				printf("No\n");
		}
	}
}