#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1);
const int n_ = 2e5 + 5;
int n, q;
long long st[n_ << 4], lazy[n_ << 4];
set<pair<pair<int, int>, int>> r;
void upd(long long v, int s, int e, int id = 1, int l = 1, int r = n) {
  int mid = (l + r) >> 1;
  if (lazy[id]) {
    lazy[id << 1] += lazy[id];
    lazy[id << 1 | 1] += lazy[id];
    st[id << 1] += lazy[id] * (mid - l + 1);
    st[id << 1 | 1] += lazy[id] * (r - mid);
    lazy[id] = 0;
  }
  if (s > r || e < l) return;
  if (s <= l && r <= e) {
    lazy[id] = v;
    st[id] += v * (r - l + 1);
    return;
  }
  upd(v, s, e, id << 1, l, mid);
  upd(v, s, e, id << 1 | 1, mid + 1, r);
  st[id] = st[id << 1] + st[id << 1 | 1];
}
long long query(int s, int e, int id = 1, int l = 1, int r = n) {
  int mid = (l + r) >> 1;
  if (lazy[id]) {
    lazy[id << 1] += lazy[id];
    lazy[id << 1 | 1] += lazy[id];
    st[id << 1] += lazy[id] * (mid - l + 1);
    st[id << 1 | 1] += lazy[id] * (r - mid);
    lazy[id] = 0;
  }
  if (s > r || e < l) return 0;
  if (s <= l && r <= e) return st[id];
  return query(s, e, id << 1, l, mid) + query(s, e, id << 1 | 1, mid + 1, r);
}
void make(int &s, int &e, int &x) {
  pair<pair<int, int>, int> cur;
  int nl, nr, nnl, nnr, ns = s;
  while (ns <= e) {
    cur = *(r.lower_bound({{ns, 0}, 0}));
    r.erase(cur);
    nl = cur.first.second;
    nr = ns - 1;
    if (nl <= nr) r.insert({{nr, nl}, cur.second});
    if (e < cur.first.first) {
      nnl = e + 1;
      nnr = cur.first.first;
      upd(abs(x - cur.second), ns, e);
      r.insert({{nnr, nnl}, cur.second});
      break;
    }
    upd(abs(x - cur.second), ns, cur.first.first);
    ns = cur.first.first + 1;
  }
  r.insert({{e, s}, x});
}
int main() {
  scanf("%d %d", &n, &q);
  int t, s, e, x;
  for (int i = 1; i <= n; i++) r.insert({{i, i}, i});
  while (q--) {
    scanf("%d %d %d", &t, &s, &e);
    if (t & 1) {
      scanf("%d", &x);
      make(s, e, x);
    } else {
      printf("%lld\n", query(s, e));
    }
  }
  return 0;
}
