#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRange {
  int logN, n;
  vector<T> ts;
  SegmentTreeRange() : logN(0), n(0) {}
  explicit SegmentTreeRange(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRange(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) (ts[aa++].*f)(args...);
      if (bb & 1) (ts[--bb].*f)(args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

template <class T> void bAdd(vector<T> &bit, int pos, const T &val) {
  const int bitN = bit.size();
  for (int x = pos; x < bitN; x |= x + 1) bit[x] += val;
}
template <class T> T bSum(const vector<T> &bit, int pos) {
  T ret = 0;
  for (int x = pos; x > 0; x &= x - 1) ret += bit[x - 1];
  return ret;
}
template <class T> T bSum(const vector<T> &bit, int pos0, int pos1) {
  return bSum(bit, pos1) - bSum(bit, pos0);
}


using U = unsigned long long;

int N, M, Q;
vector<int> O, L, R, X;
vector<U> V;


namespace brute {
vector<U> run() {
  vector<set<int>> on(N);
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j <= M; ++j) {
      on[i].insert(j);
    }
  }
  vector<U> ws(N, 0);
  vector<U> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    if (O[q] == 1) {
      for (int i = L[q]; i < R[q]; ++i) on[i].erase(X[q]);
    } else if (O[q] == 2) {
      for (int i = L[q]; i < R[q]; ++i) on[i].insert(X[q]);
    } else if (O[q] == 3) {
      int mn = M + 1;
      for (int i = L[q]; i < R[q]; ++i) chmin(mn, *on[i].begin());
      for (int i = L[q]; i < R[q]; ++i) if (mn == *on[i].begin()) ws[i] += V[q];
    } else {
      for (int i = L[q]; i < R[q]; ++i) ans[q] += ws[i];
    }
// for(int i=0;i<N;++i){cerr<<i<<": ";pv(on[i].begin(),on[i].end());}
  }
  return ans;
}
}  // brute


namespace sub2 {
// s -> xs[s], adding vs[s]
struct Func {
  int as[2];
  U vs[2];
  Func() : as{0, 1}, vs{} {}
  // *this then f
  void mul(const Func &f) {
    Func g;
    for (int x = 0; x < 2; ++x) g.as[x] = f.as[as[x]];
    for (int x = 0; x < 2; ++x) g.vs[x] = vs[x] + f.vs[as[x]];
    *this = g;
  }
};
struct Node {
  int cnts[2];
  U sum;
  Func lz;
  Node() : cnts{}, sum(0), lz() {}
  Node(int x) : cnts{}, sum(0), lz() {
    cnts[x] = 1;
  }
  void push(Node &l, Node &r) {
    l.apply(lz);
    r.apply(lz);
    lz = Func();
  }
  void pull(const Node &l, const Node &r) {
    for (int x = 0; x < 2; ++x) cnts[x] = l.cnts[x] + r.cnts[x];
    sum = l.sum + r.sum;
  }
  void apply(const Func &f) {
    for (int x = 0; x < 2; ++x) sum += cnts[x] * f.vs[x];
    int tmp[2] = {};
    for (int x = 0; x < 2; ++x) tmp[f.as[x]] += cnts[x];
    memcpy(cnts, tmp, sizeof(tmp));
    lz.mul(f);
  }
};
vector<U> run() {
cerr<<"[sub2::run]"<<endl;
  SegmentTreeRange<Node> seg(vector<Node>(N, 0));
  vector<U> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    if (O[q] == 1) {
      Func f;
      f.as[0] = 1;
      seg.ch(L[q], R[q], &Node::apply, f);
    } else if (O[q] == 2) {
      Func f;
      f.as[1] = 0;
      seg.ch(L[q], R[q], &Node::apply, f);
    } else if (O[q] == 3) {
      const auto res = seg.get(L[q], R[q]);
      Func f;
      f.vs[res.cnts[0] ? 0 : 1] = V[q];
      seg.ch(L[q], R[q], &Node::apply, f);
    } else {
      const auto res = seg.get(L[q], R[q]);
      ans[q] = res.sum;
    }
  }
  return ans;
}
}  // sub2


namespace sub4 {
struct Node {
  int mn;
  int lz;
  Node() : mn(M), lz(-1) {}
  void push(Node &l, Node &r) {
    if (~lz) {
      l.paint(lz);
      r.paint(lz);
      lz = -1;
    }
  }
  void pull(const Node &l, const Node &r) {
    mn = min(l.mn, r.mn);
  }
  void paint(int val) {
    mn = val;
    lz = val;
  }
};
vector<U> run(int Q0) {
cerr<<"[sub4::run] Q0 = "<<Q0<<endl;
  SegmentTreeRange<Node> seg(N);
  vector<vector<int>> qss(M);
  for (int q = 0; q < Q0; ++q) qss[X[q]].push_back(q);
  for (int x = M; --x >= 0; ) {
    vector<int> is;
    is.push_back(0);
    is.push_back(N);
    for (const int q : qss[x]) {
      is.push_back(L[q]);
      is.push_back(R[q]);
    }
    sort(is.begin(), is.end());
    const int isLen = is.size();
    SegmentTreeRange<Node> sub(isLen - 1);
    sub.ch(0, isLen - 1, &Node::paint, x);
    for (const int q : qss[x]) {
      const int posL = lower_bound(is.begin(), is.end(), L[q]) - is.begin();
      const int posR = lower_bound(is.begin(), is.end(), R[q]) - is.begin();
      sub.ch(posL, posR, &Node::paint, (O[q] == 1) ? M : x);
    }
    for (int j = 0; j < isLen - 1; ++j) {
      if (sub.get(j, j + 1).mn == x) {
        seg.ch(is[j], is[j + 1], &Node::paint, x);
      }
    }
  }
  vector<vector<int>> iss(M + 1);
  for (int i = 0; i < N; ++i) {
    iss[seg.get(i, i + 1).mn].push_back(i);
  }
  
  vector<int> xs3(Q, -1);
  // size [0, K): small, [K, N]: large
  int K = 0;
  {
    vector<Int> freqSz(N + 1, 0);
    for (int x = 0; x <= M; ++x) {
      ++freqSz[iss[x].size()];
    }
    vector<Int> freq3(N + 1, 0);
    Int cnt4 = 0;
    for (int q = Q0; q < Q; ++q) {
      if (O[q] == 3) {
        xs3[q] = seg.get(L[q], R[q]).mn;
        ++freq3[xs3[q]];
      } else {
        ++cnt4;
      }
    }
    Int now = cnt4 * N;
    Int mn = now;
    for (int k = 0; k <= N; ++k) {
      now += freq3[k] * k;
      now -= cnt4 * freqSz[k];
      if (chmin(mn, now)) {
        K = k + 1;
      }
    }
  }
cerr<<"xs3 = "<<xs3<<endl;
// cerr<<"K = "<<K<<endl;
  vector<U> bit(N, 0);
  vector<int> xsLarge;
  vector<vector<pair<U, U>>> bits(M + 1);
  for (int x = 0; x <= M; ++x) if ((int)iss[x].size() >= K) {
    xsLarge.push_back(x);
    bits[x].assign(iss[x].size(), make_pair(0, 0));
  }
  auto add = [&](int x, int i, U val1) -> void {
    const int pos = lower_bound(iss[x].begin(), iss[x].end(), i) - iss[x].begin();
    const U val0 = -pos * val1;
    for (int y = pos; y < (int)bits[x].size(); y |= y + 1) {
      bits[x][y].first += val0;
      bits[x][y].second += val1;
    }
  };
  auto get = [&](int x, int i) -> U {
    const int pos = lower_bound(iss[x].begin(), iss[x].end(), i) - iss[x].begin();
    U ret0 = 0, ret1 = 0;
    for (int y = pos; y > 0; y &= y - 1) {
      ret0 += bits[x][y - 1].first;
      ret1 += bits[x][y - 1].second;
    }
    return ret0 + ret1 * pos;
  };
  vector<U> ans(Q, 0);
  for (int q = Q0; q < Q; ++q) {
    if (O[q] == 3) {
      const int x = xs3[q];
      if ((int)iss[x].size() < K) {
        for (const int i : iss[x]) {
          bAdd(bit, i, V[q]);
        }
      } else {
        add(x, L[q], +V[q]);
        add(x, R[q], -V[q]);
      }
    } else {
      ans[q] += bSum(bit, L[q], R[q]);
      for (const int x : xsLarge) {
        ans[q] -= get(x, L[q]);
        ans[q] += get(x, R[q]);
      }
    }
  }
  return ans;
}
}  // sub4


int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    O.resize(Q);
    L.resize(Q);
    R.resize(Q);
    X.assign(Q, -1);
    V.assign(Q, 0);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d", &O[q], &L[q], &R[q]);
      --L[q];
      if (O[q] == 1 || O[q] == 2) {
        scanf("%d", &X[q]);
        --X[q];
      } else if (O[q] == 3) {
        scanf("%llu", &V[q]);
      }
    }
    M = max(*max_element(X.begin(), X.end()), 0) + 1;
cerr<<"N = "<<N<<", M = "<<M<<", Q = "<<Q<<endl;
    
    int Q0 = Q;
    for (int q = 0; q < Q; ++q) if (O[q] == 3 || O[q] == 4) {
      Q0 = q;
      for (int qq = q; qq < Q; ++qq) if (!(O[qq] == 3 || O[qq] == 4)) {
        Q0 = -1;
      }
      break;
    }
    
    vector<U> ans;
    if (~Q0) {
      ans = sub4::run(Q0);
    } else if (M <= 1) {
      ans = sub2::run();
    } else {
      ans = brute::run();
    }
    for (int q = 0; q < Q; ++q) if (O[q] == 4) {
      printf("%llu\n", ans[q]);
    }
#ifdef LOCAL
const auto brt=brute::run();
for(int q=0;q<Q;++q)if(brt[q]!=ans[q]){cerr<<q<<": "<<brt[q]<<" "<<ans[q]<<endl;break;}
assert(brt==ans);
#endif
  }
  return 0;
}