#164. 【清华集训2015】V

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAXN 500010
#define LL long long
LL num[MAXN];

struct H
{
LL x,y;
}mark[MAXN*4],mmax[MAXN*4];

H Up(H a,H b)
{
H tmp;
if(a.y>b.y) swap(a,b);
if(a.x-a.y>b.x-b.y) return b;
tmp.y=b.y;
tmp.x=a.x+b.y-a.y;
return tmp;
}

void Do(H &a,LL x)
{
a.y+=x;
if(a.y<0) a.x-=a.y,a.y=0;//,cout<<a.x<<endl;;
if(a.x>1000000000000000ll) a.x=1000000000000000ll;
}

void Pushdown(int now,int l,int r)
{
if(l==r) return ;

int L=now*2;
{
H tmp=mark[L];
Do(tmp,-mmax[now].x);
Do(tmp,mmax[now].y);

Do(mark[L],-mark[now].x);
Do(mark[L],mark[now].y);

mmax[L]=Up(mmax[L],mark[L]);
mmax[L]=Up(mmax[L],tmp);
}
int R=now*2+1;
{
H tmp=mark[R];
Do(tmp,-mmax[now].x);
Do(tmp,mmax[now].y);

Do(mark[R],-mark[now].x);
Do(mark[R],mark[now].y);

mmax[R]=Up(mmax[R],mark[R]);
mmax[R]=Up(mmax[R],tmp);
}
mark[now].x=0;
mark[now].y=0;
mmax[now].x=0;
mmax[now].y=0;
}

void Change(int now,int l,int r,int s,int t,LL x)
{
//  cout<<"***"<<x<<endl;

if(s<=l&&r<=t)
{
Do(mark[now],x);

mmax[now]=Up(mmax[now],mark[now]);

return ;
}   Pushdown(now,l,r);
int mid=(l+r)/2;
if(s<=mid) Change(now*2,l,mid,s,t,x);
if(mid+1<=t) Change(now*2+1,mid+1,r,s,t,x);
}

int Q(int now,int l,int r,int loc)
{
//cout<<now<<' '<<l<<' '<<r<<' '<<mark[now].x<<' '<<mark[now].y<<endl;
if(l==r) return now;  Pushdown(now,l,r);
int mid=(l+r)/2;
if(loc<=mid) return Q(now*2,l,mid,loc);
else return Q(now*2+1,mid+1,r,loc);
}

int main()
{
//  freopen("a.in","r",stdin);
//  freopen("a.out","w",stdout);

int n,m;
cin >>n >>m;
for(int i=1;i<=n;i++) scanf("%lld",&num[i]);

int opt,l,r,x;
int tmp;
LL ans;
while(m--)
{
scanf("%d",&opt);
//      cout<<'*'<<m<<endl;
switch(opt)
{
case 1: scanf("%d %d %d",&l,&r,&x);
Change(1,1,n,l,r,x);
break;
case 2: scanf("%d %d %d",&l,&r,&x);
Change(1,1,n,l,r,-x);
break;
case 3: scanf("%d %d %d",&l,&r,&x);
Change(1,1,n,l,r,(LL)-1000000000000000ll);
Change(1,1,n,l,r,x);
break;
case 4: scanf("%d",&x);
tmp=Q(1,1,n,x);
ans=0;
if(num[x]<=mark[tmp].x) ans=mark[tmp].y;
else ans=mark[tmp].y+num[x]-mark[tmp].x;
//  if(ans==0) cout<<mark[tmp].y<<endl;
//  cout<<tmp<<endl;
//  cout<<num[x]<<' '<<mark[tmp].x<<' '<<mark[tmp].y<<endl;

printf("%lld\n",ans);
break;
case 5: scanf("%d",&x);
tmp=Q(1,1,n,x);//cout<<num[x]<<' '<<mmax[tmp].x<<' '<<mmax[tmp].y<<endl;
ans=0;
if(num[x]<=mmax[tmp].x) ans=mmax[tmp].y;
else ans=mmax[tmp].y+num[x]-mmax[tmp].x;

printf("%lld\n",ans);
break;
}
}
return 0;
}