#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];
    }
    for(int a0 = 0; a0 < q; a0++){
        int qt;
        int f;
        int s,i;
        double x;
        x=-(b/a);
        long long l=0;
        cin >> qt >> f >> s;
        if(qt==1){c[f]=s;}
        else{
            for(i=f;i<=s;i++){
                l=l+c[i]*pow(x,(i-f));
            }
            if(l==0){cout<<"Yes"<<"\n";}
            else{cout<<"No"<<"\n";}
        }
    }
    return 0;
}