#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;
    double a;
    double b;
    int q;
    cin >> n;
    cin>>a >> b ;
    cin>> q;
    vector<long double> 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
        if(queryType == 1){
            c[first] = second;
        }
        
        if(queryType == 2){
            //vector<long double> ccopy = c;
            long double m,temp = c[second];
            
            for(int i=second;i>first;i--){
                m = temp/a;
                temp = c[i-1] - b*m;
            }
            if(fmod(temp,1000000007.0) == 0){
                cout<<"Yes"<<endl;
            }
            else{
                cout<<"No"<<endl;
            }
        }
    }
    return 0;
}