#include<bits/stdc++.h>
#define Lson (now<<1)
#define Rson (now<<1|1)
#define int long long
using namespace std;

const int MAXN=2e5,SIZE=524288;
const int Base=20051021,MOD=1019260817;

inline int Read()
{
	int res=0,sgn=1;char c;
	while(1) {c=getchar();if(c=='-') {sgn=-1;break;}if('0'<=c && c<='9') {res=c-'0';break;}}
	while(1) {c=getchar();if('0'<=c && c<='9') res=res*10+c-'0';else break;}
	return sgn*res;
}
inline int plu(int a,int b) {return (a+b)%MOD;}
inline int mul(int a,int b) {return 1ll*a*b%MOD;}
inline int ABS(int x)
{
	x%=MOD;x+=MOD;x%=MOD;
	return x;
}

int n,q,K,B,A[MAXN+5],pw[MAXN+5],sum[SIZE+5][2];

inline void PushUp(int now,int len)
{
	sum[now][0]=plu(sum[Lson][0],mul(pw[(len+1)>>1],sum[Rson][0]));
	sum[now][1]=plu(mul(pw[len>>1],sum[Lson][1]),sum[Rson][1]);
}
void Build(int now,int L,int R)
{
	if(L==R) {sum[now][0]=sum[now][1]=A[L];return;}
	int mid=(L+R)>>1;
	Build(Lson,L,mid);
	Build(Rson,mid+1,R);
	PushUp(now,R-L+1);
}
void Modify(int now,int L,int R,int x,int v)
{
	if(L==R) {sum[now][0]=plu(sum[now][0],v),sum[now][1]=plu(sum[now][1],v);return;}
	int mid=(L+R)>>1;
	if(x<=mid) Modify(Lson,L,mid,x,v);
	else Modify(Rson,mid+1,R,x,v);
	PushUp(now,R-L+1);
}
int Hash0(int now,int L,int R,int QL,int QR)
{
	if(QR<L || R<QL) return 0;
	if(QL<=L && R<=QR) return mul(pw[L-QL],sum[now][0]);
	int mid=(L+R)>>1;
	return plu(Hash0(Lson,L,mid,QL,QR),Hash0(Rson,mid+1,R,QL,QR));
}
int Hash1(int now,int L,int R,int QL,int QR)
{
	if(QR<L || R<QL) return 0;
	if(QL<=L && R<=QR) return mul(pw[QR-R],sum[now][1]);
	int mid=(L+R)>>1;
	return plu(Hash1(Lson,L,mid,QL,QR),Hash1(Rson,mid+1,R,QL,QR));
}
int Ask(int now,int L,int R,int x)
{
	if(L==R) return sum[now][0];
	int mid=(L+R)>>1;
	if(x<=mid) return Ask(Lson,L,mid,x);
	return Ask(Rson,mid+1,R,x);
}

signed main()
{
	n=Read(),q=Read(),K=Read(),B=Read();
	B=ABS(2*B);
	for(int i=1;i<=n;i++) A[i]=2*Read()-K*i;
	for(int i=n;i;i--) A[i]-=A[i-1];
	for(int i=1;i<=n;i++) A[i]=ABS(A[i]);
	pw[0]=1; for(int i=1;i<=n;i++) pw[i]=mul(pw[i-1],Base);
	Build(1,1,n);
	for(int opt,L,R,x;q--;)
	{
		opt=Read();
		if(opt==1)
		{
			L=Read(),R=Read(),x=Read();
			Modify(1,1,n,L,ABS(2*x)); if(R<n) Modify(1,1,n,R+1,ABS(-2*x));
		}
		else
		{
			x=Read();
			if(x==1 || x==n) {puts("0");continue;}
			if(plu(Ask(1,1,n,x),Ask(1,1,n,x+1))!=B) {puts("0");continue;}
			//printf("well\n"); 
			L=2,R=min(x,n-x)+1;
			for(int mid;L<=R;)
			{
				mid=(L+R)>>1;
				if(plu(Hash0(1,1,n,x-mid+1,x-1),Hash1(1,1,n,x+2,x+mid))) R=mid-1;
				else L=mid+1;
			}
			printf("%lld\n",R);
		}
	}
	return 0;
}