#include<bits/stdc++.h>
#define ll long long
#define task ""
using namespace std;
const ll maxn = 2e5 + 2, mod = 1e9 + 7, base = 998244353, inf = 1e18;
unsigned ll n, q, k, b, l, r, v, ok, a[maxn], p[maxn], st[2][4*maxn];
void build (int node, int l, int r)
{
    if (l == r)
    {
        st[0][node] = st[1][node] = a[l];
        return;
    }
    int mid = (l + r)/2;
    build(2*node, l, mid);
    build(2*node + 1, mid + 1, r);
    st[0][node] = st[0][2*node] + st[0][2*node + 1]*p[mid - l + 1];
    st[1][node] = st[1][2*node]*p[r - mid] + st[1][2*node + 1];
}
void update (int node, int l, int r, int idx, ll val)
{
    if (l == r)
    {
        st[0][node] = st[0][node] + val;
        st[1][node] = st[1][node] + val;
        return;
    }
    int mid = (l + r)/2;
    if (idx <= mid) update(2*node, l, mid, idx, val);
    else update(2*node + 1, mid + 1, r, idx, val);
    st[0][node] = st[0][2*node] + st[0][2*node + 1]*p[mid - l + 1];
    st[1][node] = st[1][2*node]*p[r - mid] + st[1][2*node + 1];
}
unsigned ll get (int t, int node, int l, int r, int cl, int cr)
{
    if (cr < l || r < cl) return 0;
    if (cl <= l && r <= cr)
    {
        if (t == 0) return p[l - cl]*st[t][node];
        else return p[cr - r]*st[t][node];
    }
    int mid = (l + r)/2;
    return get(t, 2*node, l, mid, cl, cr) + get(t, 2*node + 1, mid + 1, r, cl, cr);
}
int main()
{
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> q >> k >> b;
    b = 2*b;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        a[i] = 2*a[i] - i*k;
    }
    for (int i = n; i >= 1; i--) a[i] -= a[i - 1];
    p[0] = 1;
    for (int i = 1; i <= n; i++) p[i] = p[i - 1] * base;
    build(1, 1, n);
    while (q--)
    {
        cin >> ok;
        if (ok == 1)
        {
            cin >> l >> r >> v;
            v = 2*v;
            update(1, 1, n, l, v);
            if (r < n) update(1, 1, n, r + 1, -v);
        }
        else
        {
            cin >> ok;
            if (ok == 1 || ok == n || get(0, 1, 1, n, ok, ok) + get(0, 1, 1, n, ok + 1, ok + 1) != b)
            {
                cout << 0 << '\n';
                continue;
            }
            ll low = 2, high = min(ok - 1, n - ok), mid;
            while (low <= high)
            {
                mid = (low + high)/2;
                if (get(0, 1, 1, n, ok - mid + 1, ok - 1) != -get(1, 1, 1, n, ok + 2, ok + mid)) high = mid - 1;
                else low = mid + 1;
            }
            cout << high << '\n';
        }
    }
}