#include <bits/stdc++.h>

using namespace std;

#define mi (ll)1000000007
#define rep(i,a,b) for(i=a;i<b;i++)
#define repd(i,a,b,d) for (i=a;i<b;i+=d)
#define repv(i,a,b) for(i=b-1;i>=a;i--)
#define vi vector<int>
#define vl vector<long long int>
#define vvi vector <vector <int> >
#define vvii vector <vector <pair<int,int> > >
#define vvil vector <vector <pair<int,ll> > >
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
ll paw(ll a,ll b);

ll arr[110000],seg[440000];
ll c[110000];

int makeseg(int s,int l,int i)
{
  if (s==l)
    {
      seg[i]=arr[s];
      return 1;
    }
  makeseg( s, ((s+l)/2),((2*i)+1));
  makeseg( ((s+l)/2)+1 , l, ((2*i)+2));
  seg[i]=(seg[2*i+1]+seg[2*i+2])%mi;
  return 1;
}

ll rmq(int ql,int qh,int l,int h,int i)
{
  if (ql<=l&&qh>=h)
    return seg[i];
  if (ql>h||qh<l)
    return 0;
  ll lef=rmq(ql,qh,l,(l+h)/2,(2*i)+1);
  ll rig=rmq(ql,qh,((l+h)/2)+1,h,(2*i+2));

  return (lef+rig)%mi;
  
}

int updateseg(int qi, int l, int h, int i,ll val)
{
  if (l==h && l==qi)
	{
	  seg[i]=val;
	  return 0;
	}
  if (qi>h||qi<l)
    return 0;
  
  updateseg(qi,l,(l+h)/2,(2*i)+1,val);
  updateseg(qi,((l+h)/2)+1,h,(2*i+2),val);
  seg[i]=(seg[2*i+1]+seg[2*i+2])%mi;
  return 1;
}

int main()
{

  int n,i,q,t;
  ll a,b,ro,px;

  
  cin>>n>>a>>b>>q;

  ro=-1*(b/a);
  px=1;
  //  cout<<"ro "<<ro<<endl;
  rep(i,0,n)
	{	
	  cin>>c[i];
	  arr[i]=(((px*c[i])%mi + mi)%mi);
	  px = ((px*ro)%mi + mi)%mi;
	}

  makeseg(0,n-1,0);
  
  // rep(i,0,n)
  // 	cout<<arr[i]<<" ";
  // cout<<endl;

  ll af,bf,blah;

  while(q--)
	{
	  cin>>t>>af>>bf;
	  if(t==1)
		{
		  blah = (bf*paw(px,af))%mi;
		  updateseg(af,0,n-1,0,blah);
		}
	  else
		{
		  blah=rmq(0,bf-af,0,n-1,0);
		  //	  cout<<"blah "<<blah<<endl;
		  if (blah==0)
			cout<<"Yes"<<endl;
		  else
			cout<<"No"<<endl;
		}
	}
  return 0;
}


ll paw(ll a, ll b)
{
  ll x=((a)%mi),ans=1;
  while(b>0)
    {
      if (b&1)
	ans=(ans*x)%mi;
      x=(x*x)%mi;
      b>>=1;
    }
  return ans;
}