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