#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;

#ifndef ASSERT
#	define ASSERT(a) { if(!(a)) { cerr << "WTF!?\n"; *(int*)0=0; } }
#endif 

#define MOD 1000000007LL

template<class T>
T pow(T x, int power, T mod)
{
	T res = 1;

	for(T b=x; power; power>>=1)
	{
		if(power&1)
			res = (res * b) % mod;
		b = (b * b) % mod;
	}

	return res;
}

ll divm(ll a, ll b)
{
	ll ib = pow(b, MOD-2, MOD);
	ll x = a*ib % MOD;
	//ASSERT( x*b % MOD == a);
	return x;
}

template<class T, class OP>
struct SegmentTree
{
	T *a[30];
	int n, depth;
	bool builded;
	OP op;

	SegmentTree(int n_, OP op_)
		: builded(false)
		, op(op_)
	{
		n = n_;
		depth = 0;
		for(int x=n; x; x>>=1)
			++depth;

		for(int i=0; i<=depth; ++i)
			a[i] = new T[n];
	}

	~SegmentTree()
	{
		for(int i=0; i<=depth; ++i)
			delete[] a[i];
	}

	void build()
	{
		int l = n;
		for(int d=1; d<=depth; ++d)
		{
			l = (l)/2;
			for(int i=0; i<l; ++i)
				a[d][i] = merge(a[d-1][2*i], a[d-1][2*i+1]);
			//a[d][l] = Zero;
		}
	}

	void build(const T &Zero)
	{
		for(int i=0; i<n; ++i)
			a[0][i] = Zero;
		build();
	}

	T get(int l, int r, int d=0)
	{
		if(l == r)
			return a[d][l];

		T res;
		bool valid = false;

		if((l+1)/2 <= (r-1)/2)
		{
			res = get((l+1)/2, (r-1)/2, d+1);
			valid = true;
		}

		if(l&1)
		{
			if(valid)
				res = merge(res, a[d][l]);
			else
				res = a[d][l];
			valid = true;
		}

		if((r&1) == 0)
		{
			if(valid)
				res = merge(res, a[d][r]);
			else
				res = a[d][r];
			valid = true;
		}

		return res;
	}

	void update(int i, const T &v)
	{
		a[0][i] = v;

		for(int d=1; d<=depth; ++d)
		{
			i /= 2;
			a[d][i] = merge(a[d-1][2*i], a[d-1][2*i+1]);
		}
	}

	void update2(int i, const T &v)
	{
		update(i, merge(a[0][i], v));
	}

	T &operator[](int i)
	{
		return a[0][i];
	}

	T brute(int l, int r)
	{
		T res = a[0][l];
		for(int i=l+1; i<=r; ++i)
			res = merge(res, a[0][i]);
		return res;
	}

	T merge(const T &a, const T &b)
	{
		return op(a, b);
		//return (a + b);
	}
};

struct Sum
{
	ll operator()(ll a, ll b)
	{
		return (a+b)%MOD;
	}
};


int main()
{
	//ll y = divm(1, 2);
	//print(y);

	ll n, a, b, q;
	cin >> n >> a >> b >> q;
	vector<ll> c(n);
	for(int i=0; i<n; ++i)
		cin >> c[i];

	//ASSERT(b);

	ll ib = divm(1,b);
	ll ab = divm(a,b);
	vector<ll> w(n+1), xi(n+1);
	w[0] = 1;
	for(int i=1; i<=n; ++i)
		w[i] = (w[i-1] * ab) % MOD;

	SegmentTree<ll, Sum> stree(n+1, Sum());

	ll x = 0;
	stree[0] = xi[0] = x;
	int sig = 1;
	for(int i=0; i<n; ++i)
	{
		sig = (i%2 == 0 ? 1 : -1);
		ll y = (sig*(c[i]*w[n-i]%MOD) + MOD) % MOD;
		x = (x + y) % MOD;
		xi[i+1] = x;
		stree[i+1] = y;
	}
	stree.build();
	//print(x);
	//printv(xi);


	for(int i=0; i<q; ++i)
	{
		int tp;
		cin >> tp;
		if(tp == 1)
		{
			int j;
			ll xx;
			cin >> j >> xx;
			c[j] = xx;
			sig = (j%2 == 0 ? 1 : -1);
			ll y = (sig*(xx*w[n-j]%MOD) + MOD) % MOD;
			stree.update(j+1, y);
		}
		else
		{
			int l, r;
			cin >> l >> r;
			//ll y = (xi[r+1] - xi[l] + MOD) % MOD;
			if(b == 0)
			{
				if(c[l] == 0)
					cout << "Yes\n";
				else
					cout << "No\n";
				continue;
			}

			ll z = stree.get(l+1, r+1);
			//print4(l, r, y, z);
			if(z == 0)
				cout << "Yes\n";
			else
				cout << "No\n";
		}
	}

	return 0;
}