//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < int(n); ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define ALL(c) (c).begin(), (c).end()

const int mod = (int)1e9 + 7;

void add (int &a, int b)
{
    a += b;
    if (a >= mod)
        a -= mod;
}
void sub (int &a, int b)
{
    a -= b;
    if (a < 0)
        a += mod;
}
int mult (int a, int b)
{
    return (ll)a * b % mod;
}
int powmod (int a, int pw)
{
    int res = 1;
    while (pw)
    {
        if (pw & 1)
            res = mult(res, a);
        a = mult(a, a);
        pw >>= 1;
    }
    return res;
}
int inv (int a)
{
    assert(1 <= a && a < mod);
    return powmod(a, mod - 2);
}

struct segtree
{
    int tsz;
    vi vals;

    segtree (const vi &c)
    {
        tsz = 1;
        while (tsz <= sz(c))
            tsz *= 2;
        vals.assign(2 * tsz, 0);

        forn (i, sz(c))
            vals[tsz + i] = c[i];
        for (int i = tsz - 1; i >= 1; i--)
        {
            vals[i] = vals[2 * i];
            add(vals[i], vals[2 * i + 1]);
        }
    }

    void put (int pos, int what)
    {
        vals[pos += tsz] = what;
        for (pos >>= 1; pos > 0; pos >>= 1)
        {
            vals[pos] = vals[2 * pos];
            add(vals[pos], vals[2 * pos + 1]);
        }
    }

    int getseg (int l, int r)
    {
        int ans = 0;
        for (l += tsz, r += tsz; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                add(ans, vals[l++]);
            if (r & 1)
                add(ans, vals[--r]);
        }
        return ans;
    }
};

void solve (int n)
{
    int a, b, q;
    cin >> a >> b >> q;
    int x = 0;
    sub(x, mult(b, inv(a)));

    vi c(n), rc(n), mlt(n);

    int cur = 1;
    forn (i, n)
    {
        cin >> c[i];
        rc[i] = mult(c[i], cur);
        mlt[i] = cur;
        cur = mult(cur, x);
    }

    segtree data(rc);

    forn (i, q)
    {
        int t, l, r;
        cin >> t >> l >> r;
        //--l;
        if (t == 2)
            r++;
        assert(t == 1 || t == 2);

        if (x == 0)
        {
            if (t == 1)
                c[l] = r;
            else
                cout << (c[l] == 0 ? "Yes" : "No") << '\n';
        }
        else
        {
            if (t == 1)
            {
                data.put(l, mult(r, mlt[l]));
            }
            else
                cout << (data.getseg(l, r) == 0 ? "Yes" : "No") << '\n';
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    while (cin >> n)
        solve(n);
}