#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<string> VS;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
vector<int> vx;
inline void divide() {sort(vx.begin(),vx.end());vx.erase(unique(vx.begin(),vx.end()),vx.end());}
//inline int mp(int x) {return upper_bound(vx.begin(),vx.end(),x)-vx.begin();}
inline int log_2(int x) {return 31-__builtin_clz(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int lowbit(int x) {return x&-x;}
inline ll Lsqrt(ll x) { ll L = 1,R = 2e9;while(L + 1 < R){ll M = (L+R)/2;if(M*M <= x) L = M;else R = M;}return L;}
const int N = 2e5+10;
template <class T>
struct BIT
{
	T c[N];
	int sz;
	void init(int s)
	{
		sz = s;
		for(int i=1;i<=sz;++i) c[i] = 0;
	}
	T lowbit(int x)
	{
		return x&-x;
	}
	T sum(int x) 
	{
		assert(x <= sz);
		T res=0;
		while(x) res+=c[x],x-=lowbit(x);
		return res;
	}
	void update(int x,int y) 
	{
		assert(x != 0);
		while(x<=sz) c[x]+=y,x+=lowbit(x);
	}
};
BIT<int> A; 
void solve()
{
    srand(time(0));
    int n,q,k,b;
    cin>>n>>q>>k>>b;
    A.init(n);
    for(int i=1;i<=n;++i)
    {
        int a;
        cin>>a;
        A.update(i,a);
        A.update(i+1,-a);
    }
    for(int i=1;i<=q;++i)
    {
        int op;
        cin>>op;
        if(op&1)
        {
            int l,r,v;
            cin>>l>>r>>v;
            A.update(l,v);
            A.update(r+1,-v);
        }
        else
        {
            int u;
            cin>>u;
            //int w = A.sum(u);
            int res = 0;
            if(u + 1 <= n && u - 1 > 0 && A.sum(u + 1) - A.sum(u - 1) == k + b)
            {
                int L = 1, R = n;
                auto check = [&](int M)->bool
                {
                    if(u + M > n || u - M <= 0) return false;
                    for(int i = 1;i <= 100; ++i)
                    {
                        int x = rand()%M + 1;
                        if(A.sum(u + x) - A.sum(u - x) != k * x + b) return false;
                    }
                    return true;
                };
                while(L + 1 < R)
                {
                    int M = (L + R)/2;
                    if(check(M)) L = M;
                    else R = M;
                }
                res = L;
            }
            else
            {
                res = 0;
            }
            cout<<res<<'\n';
        }
    }
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	//cin>>T;
	while(T--)
	{
		solve();
	}
}