#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(){
    int n;
    int a;
    int b;
    int q;
    cin >> n >> a >> b >> q;
    vector<int> c(n);
    for(int c_i = 0; c_i < n; c_i++){
       cin >> c[c_i];
    }
    long long int Q,l,r;
    bool div=true;
    long long int root;
    long long int val,ans;
    for(int a0 = 0; a0 < q; a0++){
        cin >> Q >> l >> r;
        if(Q==1)
            c[l]=r;
        else{
            div=true;
            if(a==0 && b==0)
                cout<<"No"<<endl;
            else if(a==0){
                for(long long int i=l;i<=r;i++){
                    if(c[i]%b!=0)
                        div=false;
                }
                if(div)
                    cout<<"Yes"<<endl;
                else
                    cout<<"No"<<endl;
            }
            else{
               root=-b/a; 
                val=1;
                ans=0;
                for(long long int i=l;i<=r;i++){
                   ans+=val*c[i];
                    val*=root;
                }
                if(ans==0)
                    cout<<"Yes"<<endl;
                else
                    cout<<"No"<<endl;
            }
        }
        // your code goes here
    }
    return 0;
}