#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &x, const pair<T1, T2> &y) {
  return {x.first + y.first, x.second + y.second};
}
constexpr int MAXN = 1e5 + 10;
// ostream &operator<<(ostream &os, const sgt::node &x) {
//   return os << '(' << x.pop << " " << x.num << " " << x.sum << ')';
// }
namespace sgt {
struct node {
  ll pop, num, sum;
};
int ls(int p) { return p << 1; }
int rs(int p) { return p << 1 | 1; }
node tr[MAXN * 4];
pair<ll, ll> query(int p, int l, int r, ll num) {
  if (!num) return {};
  if (num >= tr[p].num) return {tr[p].num, tr[p].sum};
  if (l == r) return {num, tr[p].sum / tr[p].num * num};
  int mid = (l + r) >> 1;
  ll tmp = tr[p].num - tr[rs(p)].num;
  if (num <= tmp) return query(ls(p), l, mid, num);
  return query(rs(p), mid + 1, r, num - tmp) + make_pair(tmp, tr[p].sum - tr[rs(p)].sum);
}
void push_up(int p, int l, int mid) {
  pair<ll, ll> tmp = query(ls(p), l, mid, max(tr[ls(p)].num - tr[rs(p)].pop, 0ll));
  tr[p].num = tmp.first + tr[rs(p)].num;
  tr[p].sum = tmp.second + tr[rs(p)].sum;
  tr[p].pop = tr[ls(p)].pop + max(tr[rs(p)].pop - tr[ls(p)].num, 0ll);
}
void update(int p, int l, int r, int x, const node &y) {
  if (l == r) {
    tr[p] = y;
    return;
  }
  int mid = (l + r) >> 1;
  if (x <= mid) {
    update(ls(p), l, mid, x, y);
  } else {
    update(rs(p), mid + 1, r, x, y);
  }
  push_up(p, l, mid);
}
void get_vec(int p, int l, int r, int ql, int qr, vector<tuple<int, int, int>> &vec) {
  if (ql <= l && r <= qr) {
    vec.emplace_back(p, l, r);
    return;
  }
  int mid = (l + r) >> 1;
  if (ql <= mid) get_vec(ls(p), l, mid, ql, qr, vec);
  if (qr > mid) get_vec(rs(p), mid + 1, r, ql, qr, vec);
}
}  // namespace sgt
int n, m, q;
ll ans[MAXN];
vector<pair<int, sgt::node>> opt[MAXN];
vector<tuple<int, ll, ll, int>> qry[MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int om;
  cin >> n >> om;
  while (om--) {
    int typ;
    cin >> typ;
    if (typ == 1) {
      int l, r, x, y;
      cin >> l >> r >> x >> y;
      ++m;
      opt[l].emplace_back(m, sgt::node{0, x, (ll)x * y});
      opt[r + 1].emplace_back(m, sgt::node{});
    } else if (typ == 2) {
      int l, r;
      ll w;
      cin >> l >> r >> w;
      ++m;
      opt[l].emplace_back(m, sgt::node{w, 0, 0});
      opt[r + 1].emplace_back(m, sgt::node{});
    } else {
      int k;
      ll l, r;
      cin >> k >> l >> r;
      qry[k].emplace_back(m, l, r, ++q);
    }
  }
  if (!m) {
    for (int i = 1; i <= q; ++i) cout << "0\n";
    return 0;
  }
  for (int i = 1; i <= n; ++i) {
    for (auto &j : opt[i]) {
      // cout << j.first << " " << j.second << "\n";
      sgt::update(1, 1, m, j.first, j.second);
    }
    for (auto &j : qry[i]) {
      vector<tuple<int, int, int>> vec;
      sgt::get_vec(1, 1, m, 1, get<0>(j), vec);
      // for (auto &k : vec) {
      //   cout << get<0>(k) << " " << get<1>(k) << " " << get<2>(k) << " " << sgt::tr[get<0>(k)].pop << " " <<
      //           sgt::tr[get<0>(k)].num << " " << sgt::tr[get<0>(k)].sum << "\n";
      // }
      vector<ll> rem(vec.size());
      ll pop = 0;
      for (int k = vec.size() - 1; k >= 0; --k) {
        rem[k] = max(sgt::tr[get<0>(vec[k])].num - pop, 0ll);
        pop = sgt::tr[get<0>(vec[k])].pop + max(pop - sgt::tr[get<0>(vec[k])].num, 0ll);
      }
      ll num = 0;
      for (int k = 0; k < (int)vec.size(); ++k) {
        ll cl = max(num + 1, get<1>(j)), cr = min(num + rem[k], get<2>(j));
        if (cl <= cr) {
          ans[get<3>(j)] += sgt::query(get<0>(vec[k]), get<1>(vec[k]), get<2>(vec[k]), cr - num).second -
                            sgt::query(get<0>(vec[k]), get<1>(vec[k]), get<2>(vec[k]), cl - 1 - num).second;
        }
        num += rem[k];
      }
    }
  }
  for (int i = 1; i <= q; ++i) cout << ans[i] << "\n";
  return 0;
}
/*
g++ C.cpp -o C -O2 -std=c++14 -Wall -Wextra -Wshadow -g -fsanitize=optress,undefined
*/
/*
4 5
1 1 3 3 2
1 2 4 2 1
2 2 3 1
2 1 2 2
3 2 2 3
*/