#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=100010;
int n,m;
int a[N],da[100010];
struct node{
int l,r,sum,tag;//区间加法
}tr[N*4];
void pushup(int u){
tr[u].sum=tr[u*2].sum+tr[u*2+1].sum;
}
void build(int u,int l,int r){
tr[u]={l,r};
if(l==r){
tr[u].sum=da[l];
tr[u].tag=0;
return;
}
int mid=(l+r)/2;
build(u*2,l,mid);
build(u*2+1,mid+1,r);
pushup(u);
}
void down(int u,int x){
tr[u].sum+=(tr[u].r-tr[u].l+1)*x;
tr[u].tag+=x;
}
void pushdown(int u){
if(tr[u].tag==0) return;
down(u*2,tr[u].tag);
down(u*2+1,tr[u].tag);
tr[u].tag=0;
}
void change(int u,int l,int r,int x){
if(l<=tr[u].l&&tr[u].r<=r){
tr[u].sum+=(tr[u].r-tr[u].l+1)*x;
tr[u].tag+=x;
return;
}
pushdown(u);
int mid=(tr[u].l+tr[u].r)/2;
if(l<=mid) change(u*2,l,r,x);
if(r>mid) change(u*2+1,l,r,x);
pushup(u);
}
int query(int u,int l,int r){
if(l<=tr[u].l&&tr[u].r<=r){
return tr[u].sum;
}
int mid=(tr[u].l+tr[u].r)/2;
int res=0;
pushdown(u);
if(l<=mid) res+=query(u*2,l,r);
if(r>mid) res+=query(u*2+1,l,r);
return res;
}
void solve()
{ cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>da[i];
}
for(int i=n-1;i>0;i--)
da[i+1]=da[i+1]-da[i];
build(1,1,n);
while(m--){
int ok=0;cin>>ok;
if(ok==1){
int l,r,k,d; cin>>l>>r>>k>>d;
change(1,l,l,k);//防止越界
if(l+1<=r)change(1,l+1,r,d);
if(r<n)change(1,r+1,r+1,-(k+d*(r-l)));
}
else{
int id; cin>>id;
cout<<query(1,1,id)<<endl;
}
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
solve();
return 0;
}