#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 p=1000000007;

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];
    }
    for(int a0 = 0; a0 < q; a0++){
        int queryType;
        int first;
        int second;
        cin >> queryType >> first >> second;
        // your code goes here
        vector<float> rem(n);
        int i,j,k,l;
        float factor;
        if(queryType==1){
            c[first]=second;
        }
        else{
            for(i=0;i<n;++i){
                rem[i]=c[i]%p;
            }
            for(i=n-1;i>0;i--){
                factor=rem[i]/float(b);
                rem[i]=0;
                rem[i-1]-=float(a)*factor;
            }
            if(rem[i]==0)
                cout<<"Yes\n";
            else
                cout<<"No\n";
        }
    }
    return 0;
}