#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;
typedef long long ll;

ll co[100001];
ll bol[100001];
ll mo = 1000000007;


ll gcm(ll a, ll b){
    if(a==b)
        return a;
    if(a>b)
        return gcm(b,a-b);
    else
        return gcm(a,b-a);
        
}

int main(){
    ll n,a,b,q;
    cin>>n>>a>>b>>q;
    ll temp = 0;
    ll tb = 1;
    ll bolen = 10*a+b;
    
    for(int i = 0;i<n;i++){
        cin>>co[i];
        bol[i] = tb;
        //temp += (co[i]*tb);
        //temp %=mo;
        tb*=10;
        tb%=mo;
    }
    int typ;
    int fir;
    int sec;
    for(int i = 0;i<q;i++){
        cin>>typ>>fir>>sec;
        if(typ==1){
            co[fir]=sec;
        }else{
            int t;
            t = sec;
            if(co[sec]==0){
                t = sec-1;
                while(co[t]!=0){
                    t--;
                }
                if(t==fir){
                    cout<<"No"<<endl;
                    continue;
                }
            }
            ll kat = gcm(a,co[t]);
            kat = a/kat;
            kat *=co[t];
            kat%=mo;
            temp = 0;
            tb = 1;
            for(int i = fir;i<=t;i++){
                temp+=(co[i]*tb*kat);
                temp%=mo;
                tb*=10;
                tb%=mo;
            }
            if(temp%bolen==0){
                cout<<"Yes"<<endl;
            }else{
                cout<<"No"<<endl;
            }
        }
    }
    return 0;
}