#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 first;
        int second;
        cin >> queryType >> first >> second;
        // your code goes here
        if(queryType==1)
        {
        
            c[first]=second;
            
        }
        else if(queryType==2)
        {
        
            int sum=0;
            for(int i=first;i<=second;i++)
            {
            
                sum = sum+c[i];
                
            }
            if(sum%(a+b)==0)cout << "Yes"<<endl;
            else cout << "No"<<endl;
            
        }
        
    }
    return 0;
}