#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 queryType;
        int l;
        int r;
        cin >> queryType >> l >> r;
        
        if(queryType==1) c[l]=r;
        else if(queryType==2){
            vector<int> pc(r-l+1);
            for(int i=0; i<r-l+1; ++i) pc[i] = c[l+i];
            vector<int> rc(r-l);
            // get some values for r
            vector<int> qrc(r-l+1);
            qrc[0] = pc[0] - rc[0]*b;
            for(int i=1; i<r-l; ++i) qrc[i] = pc[i] - rc[i]*b - rc[i-1]*a;
            qrc[r-l] = pc[r-l] - rc[r-l-1]*a;
            for(int i=0; i<r-l+1; ++i){
                if(qrc[i]%1000000007==0){
                    cout << "Yes" << endl;
                    return 0;
                }
            }
            cout << "No" << endl;
        }
    }
    return 0;
}