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

const int mod = 1e9 + 7;

int add(int x, int y) {
	return (x += y) >= mod ? x - mod : x;
}

template<class... T>
int add(int x, T... y) {
	return add(x, add(y...));
}

int mul(int x, int y) {
	return 1LL * x * y % mod;
}

template<class... T>
int mul(int x, T... y) {
	return mul(x, mul(y...));
}

const int N = 1 << 17;

struct Tuple {
	int len;
	int sum;

	Tuple() : len(0), sum(0) {}

	Tuple(int len, int sum) : len(len), sum(sum) {}
};

int modpow(int a, long long b) {
	int ret = 1;
	while (b > 0) {
		if (b & 1) {
			ret = 1LL * ret * a % mod;
		}
		a = 1LL * a * a % mod;
		b >>= 1;
	}
	return ret;
}

Tuple dat[N * 2];
int pw[N + 1];

Tuple operator*(const Tuple &a, const Tuple &b) {
	return Tuple(a.len + b.len, add(a.sum, mul(b.sum, pw[a.len])));
}

void modify(int k, int v) {
	k += N;
	dat[k] = Tuple(1, v);
	while (k > 1) {
		k /= 2;
		dat[k] = dat[k * 2] * dat[k * 2 + 1];
	}
}

int query(int l, int r) {
	Tuple vl(0, 0), vr(0, 0);
	l += N;
	r += N;
	while (l < r) {
		if (l & 1) vl = vl * dat[l++];
		if (r & 1) vr = dat[--r] * vr;
		l /= 2;
		r /= 2;
	}
	return (vl * vr).sum;
}

int main() {
	int n, a, b, q;
	cin >> n >> a >> b >> q;

	for (int i = 0; i < n; i++) {
		int c;
		scanf("%d", &c);
		dat[i + N] = Tuple(1, c);
	}

	int v = mul(mod - b, modpow(a, mod - 2));

	pw[0] = 1;
	for (int i = 1; i <= N; i++) {
		pw[i] = mul(pw[i - 1], v);
	}

	for (int i = N - 1; i >= 1; i--) {
		dat[i] = dat[i * 2] * dat[i * 2 + 1];
	}

	while (q--) {
		int t;
		scanf("%d", &t);

		if (t == 1) {
			int i, x;
			scanf("%d %d", &i, &x);
			modify(i, x);
		} else {
			int l, r;
			scanf("%d %d", &l, &r);
			int s = query(l, r + 1);
			puts(s == 0 ? "Yes" : "No");
		}
	}
}