#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ls(p) (p<<1)
#define rs(p) (p<<1|1)
#define mid ((l+r)>>1)
const int mod=998244353;
struct seg_ment
{   
    
    static const int N=2e5+10;
    const int mod=1e9+7;
    const int base=1e6+3;
    int ans[N<<2];
    int pw[N];
    void init(int n)
    {
        pw[0]=1;
        for(int i=1;i<=n;++i) pw[i]=pw[i-1]*base%mod;
    }
    void update(int pos,int l,int r,int p,int k,int b)
    {
        if(l==r)
        {
            ans[p]=k;
            return;
        }
        if(pos<=mid) update(pos,l,mid,ls(p),k,b);
        else update(pos,mid+1,r,rs(p),k,b);

        if(b==0) //正着
        {
            ans[p]=ans[ls(p)]*pw[r-mid]%mod+ans[rs(p)];
        }
        else //反着
        {
            ans[p]=ans[rs(p)]*pw[mid-l+1]%mod+ans[ls(p)];
        }
        ans[p]=(ans[p]%mod+mod)%mod;
    }
    int query(int tl,int tr,int l,int r,int p,int b)
    {
        if(tl<=l&&r<=tr) return ans[p];
        if(tr<=mid) return query(tl,tr,l,mid,ls(p),b);
        if(tl>mid) return query(tl,tr,mid+1,r,rs(p),b);
        int t1=query(tl,tr,l,mid,ls(p),b);
        int t2=query(tl,tr,mid+1,r,rs(p),b);
        if(b==0) //正着
        {
            return (t1*(min(r,tr)-mid)+t2)%mod;
        }
        else
        {
            return (t2*(mid-max(l,tl)+1)+t1)%mod;
        }
    }
}T[4];
void solve()
{
    int n,q,k,b;
    cin>>n>>q>>k>>b;
    for (int i=0;i<=1;i++) T[i].init(n);
    std::vector<int> a(n+2);
    vector<int> c(n+2);
    vector<int> d(n+2);
    for (int i=1;i<=n;i++) {
        cin>>a[i];
        c[i]=a[i]-a[i-1];
        T[0].update(i,1,n,1,(c[i]+mod)%mod,0);
        d[i]=k-c[i];
        T[1].update(i,1,n,1,(d[i]+mod)%mod,1);
    }
    //cout<<"why"<<endl;
    while (q--){
        int op;
        cin>>op;
        //cout<<"who "<<op<<endl;
        if (op==1){
            int l,r,v;
            cin>>l>>r>>v;
            c[l]+=v,c[r+1]-=v;
            d[l]=k-c[l],d[r+1]=k-c[r+1];
            T[0].update(l,1,n,1,(c[l]+mod)%mod,0);
            T[1].update(l,1,n,1,(d[l]+mod)%mod,1);
            if (r+1<=n){
                T[0].update(r+1,1,n,1,(c[r+1]+mod)%mod,0);
                T[1].update(r+1,1,n,1,(d[r+1]+mod)%mod,1);
            }
        }
        else{
            int x;
            cin>>x;
            if (x==n) {
                cout<<0<<"\n";
                continue;
            }
            if (c[x]+c[x+1]==k+b){
                int ans=1;
                int len=min(n-(x+2)+1,x-1-1+1);
                int l=1,r=len;
                while (l<=r){
                    // int mid=(l+r)>>1;
                   // cout<<l<<" "<<r<<" "<<mid<<endl;
                    len=mid;
                    int tmp1=T[0].query(x+2,x+2+len-1,1,n,1,0);
                    int tmp2=T[1].query(x-1-len+1,x-1,1,n,1,1);
                    tmp1=(tmp1%mod+mod)%mod;
                    tmp2=(tmp2%mod+mod)%mod;
                   // cout<<x+2<<",,,"<<x+2+len-1<<endl;
                   // cout<<tmp1<<" hahah "<<tmp2<<endl;
                    if (tmp1==tmp2){
                        ans=mid+1;
                        l=mid+1;
                    }
                    else r=mid-1;
                }
                cout<<ans<<"\n";
            }
            else cout<<0<<"\n";
           // for (int i=1;i<=n;i++) cout<<c[i]<<" ";
           //     cout<<endl;
           // for (int i=1;i<=n;i++) cout<<d[i]<<" ";
           //     cout<<endl;
        }
    }

}


signed main()
{
    ios::sync_with_stdio(false);cin.tie(0);cin.tie(0);
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)
    {
        solve();
    }
    return 0;
}