// baoli

#include <bits/stdc++.h>

#if defined(LOCAL)
#define DBG_MACRO_NO_WARNING
#include <dbg.hpp>
#else
#define dbg(x...) (0)
#endif

using namespace std;

using ll = long long;

// #define int ll
#define rep(i, f, t) for (int i = (f), ed##i = (t); i <= ed##i; ++i)
#define re(i, t) rep (i, 1, t)
#define per(i, t, f) for (int i = (t), ed##i = (f); i >= ed##i; --i)
#define ste(i, f, t, s) for (int i = (f), ed##i = (t); i <= ed##i; i += s)
#define nxt(i, f, g) for (int i = g.h[f]; i; i = g.e[i].n)
#define umod(x) ((x) >= mo && ((x) -= mo))
#define dmod(x) ((x) < 0 && ((x) += mo))
#define y1 y1__
#define fio(x) (freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout))

template <class T, class E>
__attribute__((always_inline)) inline void up(T &x, E &&y) {
  if (x < y) x = y;
}
template <class T, class E>
__attribute__((always_inline)) inline void down(T &x, E &&y) {
  if (y < x) x = y;
}

const int N = 1e5 + 9;
int n, m;
vector<pair<int, int>> sta[N];

inline void Pop(int p, ll x) {
  while (x && sta[p].size()) {
    if (sta[p].back().first <= x)
      x -= sta[p].back().first, sta[p].pop_back();
    else
      sta[p].back().first -= x, x = 0;
  }
}

inline ll Ask(int p, ll l, ll r) {
  --l;
  ll sum = 0, ans = 0;
  // dbg(sta[p]);
  for (auto [cnt, val] : sta[p]) {
    // dbg(max(l, sum));
    // dbg(min(r, sum + cnt));
    ans += 1ll * val * max(0ll, (min(r, sum + cnt) - max(l, sum)));
    sum += cnt;
  }
  return ans;
}

signed main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  while (m--) {
    int op;
    cin >> op;
    if (op == 1) {
      int l, r, x, y;
      cin >> l >> r >> x >> y;
      rep (i, l, r) sta[i].push_back({x, y});
    } else if (op == 2) {
      int l, r;
      ll x;
      cin >> l >> r >> x;
      rep (i, l, r) Pop(i, x);
    } else if (op == 3) {
      int p;
      ll l, r;
      cin >> p >> l >> r;
      cout << Ask(p, l, r) << '\n';
    }
  }
  return 0;
}