//----------shivam_wadhwa----------//
#include <bits/stdc++.h>
#define ll long long int
#define sc1(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define scll(x) scanf("%lld",&x)
#define pint(c) printf("%d",c)
#define pll(c) printf("%lld",c)
#define ps() printf(" ")
#define pn() printf("\n")

#define vi vector<int>
#define vii vector<pair<int,int> >
#define mp make_pair
#define pb push_back

//loops
#define ff(i,n,a) for(i=a;i<n;++i)
#define fb(i,n,a) for(i=n,i>=a;--i)

//constants
const int mxn=1e5+1;
const int MOD=1e9+7;
using namespace std;
int main()
{
	int t=1;
//	sc1(t);
	while(t--)
	{
		int n,a,b,q;
		cin>>n>>a>>b>>q;
		int A[n];
		for(int i=0;i<n;++i)
		{
			cin>>A[i];
		}		
		while(q--)
		{
			int ch;
			cin>>ch;
			if(ch==1)
			{
				int in,val;
				A[in]=val;
			}
			else
			{
				int l,r;
				cin>>l>>r;
				long double sum=0;
				for(int i=l;i<=r;++i)
				{
					sum+=(A[i]*pow((-b/a),i-l));
					while(sum>MOD)
					{
						sum-=MOD;
					}
				}
				if(sum==0)
					cout<<"Yes"<<endl;
				else
					cout<<"No"<<endl;
			}
		}
	}
	return 0;
}