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



int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    ll n,q,a,b;
    cin>>n;
    vector<ll>c(n);
    cin>>a>>b>>q;
    ll x_num = -b;
    ll x_dem = a;
    double x = -b/a;
    
    for (ll i=0;i<n;i++){
        cin>>c[i];
    }
    
    vector<double> powx(n);
    for (ll i=0;i<n;i++){
        powx[i]=pow(x,i);
    }
    
    ll type, index, value, left, right;
    for (ll i=0;i<q;i++){
        cin>>type;
        if (type==1){
            cin>>index>>value;
            c[index]=value;            
        }
        else if (type==2){
            cin>>left>>right;
            double sum=0;
            for (ll k=0;k<right-left+1;k++){
                //sum += c[left+k]*pow(x_num,k)/pow(x_dem,k);
                sum += c[left+k]*powx[k];
            }        
            
            if (sum!=0){
                cout<<"No"<<endl;
            }
            else {
                cout<<"Yes"<<endl;
            }
        }
    }
    return 0;
}