/*
author:yllcm
link:https://loj.ac/s/1973855
*/
#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
#define int long long
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 1e5 + 10;
int n, Q;
int a[N];
struct Block {
  int B, T;
  int cnt[N], L[N], R[N], pos[N], sum[N], ts[N], vis[N];
  void build() {
    B = sqrt(n);
    for(int i = 1; i <= n; i += B) {
      L[++T] = i; R[T] = min(n, i + B - 1);
      for(int j = L[T]; j <= R[T]; j++)
        sum[pos[j] = T] += a[j], cnt[T]++;
    }
    return ;
  }
  void ins(int x, int w) {
    cnt[pos[x]] -= w; vis[x] += w;
    if(w == 1)sum[pos[x]] -= a[x] + ts[pos[x]], a[x] = 0;
    else a[x] = -ts[pos[x]];
    // cout << x << ' ' << w << ' ' << a[x] + ts[pos[x]] << endl;
    return ;
  }
  void pushdown(int x) {
    for(int i = L[x]; i <= R[x]; i++)if(!vis[i])a[i] += ts[x];
    ts[x] = 0;
    return ;
  }
  void update(int l, int r, int w) {
    int bl = pos[l], br = pos[r];
    if(bl == br) {
      pushdown(bl);
      for(int i = l; i <= r; i++)if(!vis[i])a[i] += w, sum[bl] += w;
      return ;
    }
    pushdown(bl); pushdown(br);
    for(int i = l; i <= R[bl]; i++)if(!vis[i])a[i] += w, sum[bl] += w;
    for(int i = L[br]; i <= r; i++)if(!vis[i])a[i] += w, sum[br] += w;
    for(int i = bl + 1; i < br; i++)sum[i] += cnt[i] * w, ts[i] += w;
    return ;
  }
  int query(int l, int r) {
    int bl = pos[l], br = pos[r], res = 0;
    if(bl == br) {
      pushdown(bl);
      for(int i = l; i <= r; i++)if(!vis[i])res += a[i] + ts[bl];
      return res;
    }
    pushdown(bl); pushdown(br);
    for(int i = l; i <= R[bl]; i++)if(!vis[i])res += a[i] + ts[bl];
    for(int i = L[br]; i <= r; i++)if(!vis[i])res += a[i] + ts[br];
    // cout << "qyr:" << l << ' ' << r << endl;
    // for(int i = l; i <= R[bl]; i++)cout << vis[i] << ' '; cout << endl;
    // for(int i = L[br]; i <= r; i++)cout << vis[i] << ' '; cout << endl;
    // for(int i = bl + 1; i < br; i++)cout << sum[i] << ' '; cout << endl;
    // cout << "q:" << bl << ' ' << br << ' ' << l << ' ' << r << ' ' << res << endl;
    for(int i = bl + 1; i < br; i++)res += sum[i];
    return res;
  }
}bl;
struct Fire {
  vector<pii> fi;
  void ins(int x) {
    vector<pii> nfi;
    for(auto t : fi)if(x >= t.FR && x <= t.SE)return ;
    int flg = 0;
    for(auto t : fi) {
      if(t.FR > x && !flg)nfi.pb({x, x}), flg = 1;
      nfi.pb(t);
    }
    if(!flg)nfi.pb({x, x});
    swap(fi, nfi);
    bl.ins(x, 1);
    return ;
  }
  void del(int l, int r) {
    vector<pii> nfi;
    for(auto t : fi) {
      int tl = max(l, t.FR), tr = min(r, t.SE);
      if(tl > tr) {nfi.pb(t); continue;}
      for(int j = tl; j <= tr; j++)bl.ins(j, -1);
      // cout << l << ' ' << r << endl;
      if(tl == t.FR && tr == t.SE)continue;
      if(tl > t.FR && tr < t.SE)nfi.pb({t.FR, tl - 1}), nfi.pb({tr + 1, t.SE});
      else nfi.pb(tl > t.FR ? (pii){t.FR, tl - 1} : (pii){tr + 1, t.SE});
    }
    swap(fi, nfi);
    return ;
  }
  void grow() {
    vector<pii> nfi;
    for(auto t : fi) {
      if(nfi.size() && nfi.back().SE >= t.FR - 1) {
        nfi.back().SE = min(n, t.SE + 1);
        if(t.SE < n && !bl.vis[t.SE + 1])bl.ins(t.SE + 1, 1);
      }
      else {
        pii tmp(max(1ll, t.FR - 1), min(n, t.SE + 1));
        // cout << "grow:" << t.FR << ' ' << t.SE << endl;
        if(t.FR > 1 && !bl.vis[t.FR - 1])bl.ins(t.FR - 1, 1);
        if(t.SE < n && !bl.vis[t.SE + 1])bl.ins(t.SE + 1, 1);
        nfi.pb(tmp);
      }
    }
    swap(fi, nfi);
    return ;
  }
  void debug() {
    cout << "debug\n";
    for(auto t : fi)printf("%d %d\n", t.FR, t.SE);
    return ;
  } 
}fire;
signed main() {
  n = read(); Q = read();
  for(int i = 1; i <= n; i++)a[i] = read();
  bl.build();
  while(Q--) {
    int op = read();
    if(op == 1) {
      int l = read(), r = read(), k = read();
      bl.update(l, r, k);
    }
    else if(op == 2) {
      int l = read(), r = read();
      printf("%lld\n", bl.query(l, r));
    }
    else if(op == 3) {
      int pos = read();
      fire.ins(pos);
    }
    else if(op == 4) {
      int l = read(), r = read();
      fire.del(l, r);
    }
    fire.grow();
  }
  return 0;
}