/******************************************
*    AUTHOR:         BHUVNESH JAIN        *
*    INSTITUITION:   BITS PILANI, PILANI  *
******************************************/
#include <bits/stdc++.h>
using namespace std;
 
typedef long long LL; 
typedef long double LD;

const int MOD = 1e9 + 7;

template<typename T> T gcd(T a, T b) { return (b ? __gcd(a,b) : a); }

template<typename T> T lcm(T a, T b) { return (a * (b / gcd(a,b))); }

int add(int a, int b, int c) {
	int res = a + b;
	return (res >= c ? res - c : res);
}

int mod_neg(int a, int b, int c) {
	int res; if(abs(a-b) < c) res = a - b;
	else res = (a-b) % c;
	return (res < 0 ? res + c : res);
}

int mul(int a, int b, int c) {
	long long res = (long long)a * b;
	return (res >= c ? res % c : res);
}

int power(long long a, long long n, int m) {
	int x = 1, p = a % m;
	while(n) {
		if(n & 1) x = mul(x, p, m);
		p = mul(p, p, m);
		n >>= 1;
	}
	return x;
}

template<typename T> T extended_euclid(T a, T b, T &x, T &y) {
	T xx = 0, yy = 1; y = 0; x = 1;
	while(b) {
		T q = a / b, t = b;
		b = a % b; a = t;
		t = xx; xx = x - q * xx;
		x = t; t = yy;
		yy = y - q * yy; y = t;
	}
	return a;
}

template<typename T> T mod_inverse(T a, T n) {
	T x, y, z = 0; 
	T d = extended_euclid(a, n, x, y);
	return (d > 1 ? -1 : mod_neg(x, z, n));
}

int p[100005];

int main() {
	#ifndef ONLINE_JUDGE
		// freopen("inp.txt", "r", stdin);
	#endif
	int n, a, b, q;
	scanf("%d %d %d %d", &n, &a, &b, &q);
	for(int i = 0; i < n; ++i) {
		scanf("%d", &p[i]);
	}
	int root = mul((MOD - b), mod_inverse(a, MOD), MOD);
	int t, l, r;
	while(q--) {
		scanf("%d %d %d", &t, &l, &r);
		if (t == 1) {
			p[l] = r;
		}
		else {
			int val = 0;
			int m = 1;
			for(int i = l; i <= r; ++i) {
				val = add(val, mul(p[i], m, MOD), MOD);
				m = mul(m, root, MOD);
			}
			if (val == 0) {
				puts("Yes");
			}
			else {
				puts("No");
			}
		}
	}
	return 0;
}