#include <bits/stdc++.h>
using namespace std;
struct range {
  int l, r, c;
  range(int l = 0, int r = 0, int c = 0) : l(l), r(r), c(c) {}
  bool operator<(const range &o) const { return l < o.l; }
};
int N, M;
long long t[400010], lz[400010];
set<range> rng;
void unlz(int nod, int l, int r) {
  if (lz[nod] == 0) return;
  t[nod] += (r - l + 1) * lz[nod];
  if (l != r) lz[nod * 2] += lz[nod], lz[nod * 2 + 1] += lz[nod];
  lz[nod] = 0;
}
void upd(int nod, int l, int r, int ql, int qr, int val) {
  unlz(nod, l, r);
  if (ql <= l && r <= qr) {
    lz[nod] += val;
    return;
  }
  int mid = (l + r) / 2;
  if (ql <= mid) upd(nod * 2, l, mid, ql, qr, val);
  if (mid < qr) upd(nod * 2 + 1, mid + 1, r, ql, qr, val);
  unlz(nod * 2, l, mid), unlz(nod * 2 + 1, mid + 1, r);
  t[nod] = t[nod * 2] + t[nod * 2 + 1];
}
long long query(int nod, int l, int r, int ql, int qr) {
  unlz(nod, l, r);
  if (ql <= l && r <= qr) return t[nod];
  int mid = (l + r) / 2;
  long long res = 0;
  if (ql <= mid) res += query(nod * 2, l, mid, ql, qr);
  if (mid < qr) res += query(nod * 2 + 1, mid + 1, r, ql, qr);
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> M;
  int i;
  for (i = 1; i <= N; i++) rng.insert(range(i, i, i));
  while (M--) {
    int tp, l, r, x;
    cin >> tp;
    if (tp == 1) {
      cin >> l >> r >> x;
      auto it = --rng.upper_bound(range(l));
      if ((*it).l < l) {
        range rg = *it;
        rng.erase(it);
        rng.insert(range(rg.l, l - 1, rg.c));
        it = rng.insert(range(l, rg.r, rg.c)).first;
      }
      range rg;
      int lr = -1;
      while (it != rng.end() && (*it).r <= r) {
        rg = *it;
        it = rng.erase(it);
        upd(1, 1, N, rg.l, rg.r, abs(rg.c - x));
        lr = rg.r;
      }
      if (it != rng.end() && (*it).l <= r) {
        rg = (*it);
        rng.erase(it);
        rng.insert(range(rg.l, r, x));
        rng.insert(range(r + 1, rg.r, rg.c));
        upd(1, 1, N, rg.l, r, abs(rg.c - x));
      }
      if (lr != -1) rng.insert(range(l, lr, x));
    } else {
      cin >> l >> r;
      cout << query(1, 1, N, l, r) << "\n";
    }
  }
  return 0;
}
