#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    long long int sum,n,q;
    float a,b;
    
    cin >> n >> a >> b >> q;
    vector<int> c(n);
    for(int c_i = 0; c_i < n; c_i++){
       cin >> c[c_i];
    }
    for(int a0 = 0; a0 < q; a0++){
        
        int queryType;
        int first;
        int second;
        cin >> queryType >> first >> second;
        if(queryType==1)
            c[first]=second;
        else
        {
            sum=0;
            for(long long int i=0;i<=second-first;i++)
            {
                
                sum+=c[first+i]*pow(-b/a,i);
                //cout<<"sum"<<c[first+i]*pow(-b/a,i)<<endl;
            }
            if(sum)
                cout<<"No\n";
            else
                cout<<"Yes\n";
                
        }
     //   cout<<"c\n";
       // for(int c_i = 0; c_i < n; c_i++)
       //cout<< c[c_i];
        // your code goes here
    }
    return 0;
}