#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1e5, S = 1 << 18;

// cnt, kill, sum, lsum
array<int64_t, 4> t[S];

int64_t bal(int i) { return t[2 * i + 1][0] + t[2 * i + 2][1]; }

int64_t que(int i, int L, int R, int64_t cnt) {
  if (cnt <= 0) return 0;
  if (cnt >= t[i][0]) return t[i][2];
  if (R == L + 1) return t[i][2] / t[i][0] * cnt;
  int M = (L + R) / 2;
  if (cnt <= bal(i)) return que(2 * i + 1, L, M, cnt);
  else return t[i][3] + que(2 * i + 2, M, R, cnt - max(bal(i), {}));
}

void upd(int i, int L, int R, int j, int64_t cnt, int64_t kill, int64_t sum) {
  if (R == L + 1) return void(t[i] = {cnt, kill, sum});
  int M = (L + R) / 2;
  if (j < M) upd(2 * i + 1, L, M, j, cnt, kill, sum);
  else       upd(2 * i + 2, M, R, j, cnt, kill, sum);
  auto q = que(2 * i + 1, L, M, bal(i));
  t[i] = {max(bal(i), {}) + t[2 * i + 2][0],
          min(bal(i), {}) + t[2 * i + 1][1], q + t[2 * i + 2][2], q};
}

int64_t killmem[101];
int ks;

int64_t getkill(int i, int L, int R, int r) {
  int ks = ::ks++;
  if (L >= r) return 0;
  if (R <= r) return killmem[ks] = t[i][1];
  int M = (L + R) / 2;
  if (r <= M) return killmem[ks] = getkill(2 * i + 1, L, M, r);
  return killmem[ks] = min(getkill(2 * i + 2, M, R, r) + t[2 * i + 1][0], {}) + t[2 * i + 1][1];
}

int64_t getsum(int i, int L, int R, int r, int64_t cnt) {
  if (L >= r) return 0;
  if (R <= r) return que(i, L, R, cnt);
  ++ks;
  int M = (L + R) / 2;
  if (r <= M) return getsum(2 * i + 1, L, M, r, cnt);
  int64_t lcnt = min(cnt, max(killmem[ks] + t[2 * i + 1][0], {}));
  int64_t ans = que(2 * i + 1, L, M, lcnt);
  return ans + getsum(2 * i + 2, M, R, r, cnt - lcnt);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  vector<array<int64_t, 5>> ops;
  vector<array<int64_t, 4>> qs;
  vector<int64_t> ans(m, -1);
  for (int i = 0; i < m; ++i) {
    int t; cin >> t;
    if (t == 1) {
      int64_t l, r, x, y; cin >> l >> r >> x >> y; --l;
      ops.push_back({l, i, 0, x, x * y});
      ops.push_back({r, i});
    } else if (t == 2) {
      int64_t l, r, w; cin >> l >> r >> w; --l;
      ops.push_back({l, i, -w});
      ops.push_back({r, i});
    } else {
      int64_t k, p, q; cin >> k >> p >> q; --k;
      qs.push_back({k, i, p, q});
    }
  }
  sort(ops.begin(), ops.end());
  sort(qs.begin(), qs.end());
  for (int j = 0; auto [t, i, p, q]: qs) {
    while (j < ops.size() && ops[j][0] <= t) { auto [_, i, k, c, s] = ops[j++]; upd(0, 0, m, i, c, k, s); }
    ks = 0, getkill(0, 0, m, i), ks = 0, ans[i] = getsum(0, 0, m, i, q), ks = 0, ans[i] -= getsum(0, 0, m, i, p - 1);
  }
  for (int i = 0; i < m; ++i) if (~ans[i]) cout << ans[i] << '\n';
}