#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define ll          long long
#define pb          push_back
#define mp          make_pair
#define pii         pair<int,int>
#define vi          vector<int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define endl        '\n'
#define rep(i,a,b)	for(int i=a;i<b;i++)
using namespace std;

void solve(){
	int n,a,b,q;
	cin>>n>>a>>b>>q;
	double val=-b*1.0l/a;
	vi x(n);
	rep(i,0,n)cin>>x[i];
	rep(i,0,q){
		int type;
		cin>>type;
		if(type==1){
			int i,p;
			cin>>i>>p;
			x[i]=p;
		}
		else{
			int l,r;
			cin>>l>>r;
			double cur=0;
			for(int i=r;i>=l;i--){
				cur*=val;
				cur+=x[i];
				if(cur>hell)cur-=hell;
			}
			if(abs(cur)<1e-5)cout<<"Yes\n";
			else cout<<"No\n";
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t=1;
//	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}