#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed << setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T1, class T2> inline int chkmin(T1& a, const T2& val) {return val < a ? a = val, 1 : 0;}
template<class T1, class T2> inline int chkmax(T1& a, const T2& val) {return a < val ? a = val, 1 : 0;}
template<class T> inline T isqrt(T k) {T r = sqrt(k) + 1; while (r * r > k) r--; return r;}
template<class T> inline T icbrt(T k) {T r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return (int) fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}

const int maxn = 100000 + 10;
int n, a, b, q;
int c[maxn];
int st[maxn << 1];
int sz[maxn << 1];
int p[maxn];

inline int merge(int x, int y, int size) {
    int res = x;
    addmod(res, mult(y, p[size]));
    return res;
}

void build() {
    FOR(i, n, n + n) st[i] = c[i - n], sz[i] = 1;
    FORd(i, n, 1) {
        sz[i] = sz[i << 1] + sz[i << 1 | 1];
        st[i] = merge(st[i << 1], st[i << 1 | 1], sz[i << 1]);
    }
}

void upd(int i, int val) {
    for (st[i += n] = val; i > 1; ) {
        i >>= 1;
        st[i] = merge(st[i << 1], st[i << 1 | 1], sz[i << 1]);
    }
}

int query(int l, int r) {
    int lres = 0, tot = 0, rres = 0;
    for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
        if (l & 1) {
            lres = merge(lres, st[l], tot);
            tot += sz[l];
            l++;
        }
        if (r & 1) {
            r--;
            rres = merge(st[r], rres, sz[r]);
        }
    }
    return merge(lres, rres, tot);
}

void solve() {
    cin >> n >> a >> b >> q;
    FOR(i, 0, n) cin >> c[i];
    p[0] = 1;
    p[1] = mult(MOD - b, inv(a));
    FOR(i, 2, maxn) p[i] = mult(p[i - 1], p[1]);
    build();
    while (q--) {
        int op; cin >> op;
        if (op == 1) {
            int u, x; cin >> u >> x;
            upd(u, x);
        }
        else {
            int l, r; cin >> l >> r;
            if (query(l, r)) {
                cout << "No\n";
            }
            else {
                cout << "Yes\n";
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("in.txt", "r")) {
        freopen("in.txt", "r", stdin);
    }
    solve();
    cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms\n";
    return 0;
}