#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 gcd(int a, int b)
{
  if (b == 0)
    return a;
  else
    return gcd(b, a%b);
}

int lcm(int a, int b)
{
  return (a*b)/gcd(a,b);
}

int main(){
    int n;
    int a;
    int b;
    int q;
    vector<int> p;
    cin >> n >> a >> b >> q;
    int z[n];
    for(int i=0;i<n;i++)
        cin>>z[i];
    int type,l,r;
    int g[2];
    g[0]=b;
    g[1]=a;
    int rt,rem;
    for(int i=0;i<q;i++)
        {
        cin>>type>>l>>r;
        if(type==1)
            {
            z[l]=r;
        }
        else 
            {
            p.resize(r-l);
            for(int i=0;i<p.size();i++)
                p[i]=z[l+i];
            while(p.size()>1)
                {
                rt=lcm(a,p[p.size()-1]);
                rem=rt/a;
                g[0]*=rem;
                g[1]=rt;
                p.resize(p.size()-1);
                p[p.size()-1]-=g[0];
                g[0]=b;
                g[1]=a;
            }
            if(p[0]==0)
                cout<<"Yes"<<endl;
            else
                cout<<"No"<<endl;
        }
    }
    return 0;
}