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

int main() {
    ll n,qa,qb,test;
    cin>>n>>qa>>qb>>test;
    vector<ll>vec(n);
    for(int i=0;i<n;i++) cin>>vec[i];
    while(test--){
        ll type,a,b;
        cin>>type>>a>>b;
        ll cnt=qa+qb,sum=0;
        if(type==2){
            for(int i=0;i<n;i++) sum+=vec[i];
            if(sum%cnt==0) {
                cout<<"Yes\n";
            }
            else cout<<"No\n";
        }
        else{
            vec[a]=b;
        }
    }
    return 0;
}