#pragma GCC O(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pi;
#define V vector
#define fi first
#define se second
#define pb push_back
#define all1(x) (x).begin() + 1, (x).end()

const int MN = 2e5 + 1000;

const LL mod = 1e9 + 9;
const int base = 233;
LL pbase[MN];
LL tot1[MN];

LL mul(LL a, LL b) {
    return a * b % mod;
}

LL posi(LL x) {
    if(x < 0) x += mod;
    return x;
}

LL add(LL a, LL b) {
    LL ans = a + b;
    if(ans >= mod) ans -= mod;
    return ans;
}

struct info {
    int len;
    LL hs, rhs;
}i0{0, 0, 0};

struct tag {
    LL add;
}t0{0};

struct node {
    info i;
    tag t;
}seg[MN * 4];

info operator+(info a, info b) {
    return {a.len + b.len, add(a.hs, mul(b.hs, pbase[a.len])), add(b.rhs, mul(a.rhs, pbase[b.len]))};
}
info operator + (info a, tag t) {
    return {a.len, add(a.hs, mul(tot1[a.len], posi(t.add))), add(a.rhs, mul(tot1[a.len], posi(t.add)))};
}
tag operator +(tag a, tag b) {
    return {a.add + b.add};
}

void upd(int x) {
    seg[x].i = seg[x * 2].i + seg[x * 2 + 1].i;
}

void push_down(int x) {
    if(seg[x].t.add == 0) return;
    seg[x * 2].i = seg[x * 2].i + seg[x].t;
    seg[x * 2 + 1].i = seg[x * 2 + 1].i + seg[x].t;
    seg[x * 2].t = seg[x * 2].t + seg[x].t;
    seg[x * 2 + 1].t = seg[x * 2 + 1].t + seg[x].t;
    seg[x].t = t0;
}

void build(V<info> v) {
    int n = v.size() - 1;
    auto dfs = [&](int x, int l, int r, auto dfs) -> void {
        if(l == r) seg[x].i = v[l];
        else {
            int mid = l + r >> 1;
            dfs(x * 2, l, mid, dfs), dfs(x * 2 + 1, mid + 1, r, dfs);
            upd(x);
        }
    };
    dfs(1, 1, n, dfs);
}
info query(int x, int l, int r, int ql, int qr) {
    if(ql <= l && qr >= r) {
        return seg[x].i;
    }
    int mid = l + r >> 1;
    push_down(x);
    info ans = i0;
    if(ql <= mid) ans = ans + query(x * 2, l, mid, ql, qr);
    if(qr >= mid + 1) ans = ans + query(x * 2 + 1, mid + 1, r, ql, qr);
    return ans;
}
void modify(int x, int l, int r, int ql, int qr, tag t) {
    if(ql <= l && qr >= r) {
        seg[x].i = seg[x].i + t;
        seg[x].t = seg[x].t + t;
        return;
    }
    int mid = l + r >> 1;
    push_down(x);
    if(ql <= mid) modify(x * 2, l, mid, ql, qr, t);
    if(qr >= mid + 1) modify(x * 2 + 1, mid + 1, r, ql, qr, t);
    upd(x);
}


void solve() {
    int n; cin >> n;
    int q; cin >> q;
    int k, b; cin >> k >> b;
    V<int> a(n + 1);
    V<LL> should(n + 1);
    should[0] = 0;
    for(int i = 1; i <= n; i++) should[i] = add(mul(posi(k * i + b), pbase[i]), should[i - 1]);

    for(int i = 1; i <= n; i++) cin >> a[i];

    V<info> ini_tree(n + 1);
    for(int i = 1; i <= n; i++) {
        ini_tree[i] = {1, mul(base, posi(a[i])), mul(base, posi(a[i]))};
    }
    build(ini_tree);

    for(int i = 1; i <= q; i++) {
        int t; cin >> t;
        if(t == 1) {
            int l, r, v; cin >> l >> r >> v;
            modify(1, 1, n, l, r, {v});
        } else {
            int i; cin >> i;
            int l = 0, r = i;
            while(l != r - 1) {
                int mid = l + r >> 1;
                bool ok;
                int len = i - mid;
                if(2 * i - mid > n) ok = 0;
                else {
                    LL hs1 = query(1, 1, n, mid, i - 1).rhs;
                    LL hs2 = query(1, 1, n, i + 1, 2 * i - mid).hs;
                    if(add(mod - hs1, hs2) == should[len]) ok = 1;
                    else ok = 0;
                }
                if(ok) r = mid;
                else l = mid;
            }
            cout << i - r << "\n";
        }
        // for(int i = 1; i <= n; i++) cout << query(1, 1, n, i, i).hs / 233 << " ";
        // cout << endl;
    }
}

int main() {
    pbase[0] = 1;
    for(int i = 1; i <= 2e5 + 10; i++) pbase[i] = mul(pbase[i - 1], base);
    tot1[0] = 0;
    for(int i = 1; i <= 2e5 + 10; i++) tot1[i] = add(tot1[i - 1], pbase[i]);
    ios::sync_with_stdio(0), cin.tie(0);
    // int t; cin >> t;
    int t = 1;
    while(t--) solve();
}