#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e5 + 100;
const int maxbl = 320;
const int mod = (int)1e9 + 9;
const int maxlog = (int)20;
const int P = mod;
int n, m, color[4 * maxn];
long long t[4 * maxn], lz[4 * maxn];
void build(int v = 1, int tl = 1, int tr = n) {
  if (tl == tr) {
    color[v] = tl;
    return;
  }
  int tm = (tl + tr) >> 1;
  build(v + v, tl, tm);
  build(v + v + 1, tm + 1, tr);
}
void push(int v, int tl, int tr) {
  if (lz[v]) {
    t[v] += (tr - tl + 1) * lz[v];
    if (tl != tr) lz[v * 2] += lz[v], lz[v * 2 + 1] += lz[v];
    lz[v] = 0;
  }
  if (color[v] && tl != tr) color[v * 2] = color[v * 2 + 1] = color[v];
}
inline void upd(int l, int r, int x, int v = 1, int tl = 1, int tr = n) {
  push(v, tl, tr);
  if (l > r || tr < l || tl > r) return;
  if (l <= tl && tr <= r && color[v]) {
    lz[v] += abs(color[v] - x);
    color[v] = x;
    push(v, tl, tr);
    return;
  }
  int tm = (tl + tr) >> 1;
  upd(l, r, x, v + v, tl, tm);
  upd(l, r, x, v + v + 1, tm + 1, tr);
  t[v] = t[v + v] + t[v + v + 1];
  color[v] = 0;
  if (color[v + v] == color[v + v + 1]) color[v] = color[v + v];
}
long long get(int l, int r, int v = 1, int tl = 1, int tr = n) {
  push(v, tl, tr);
  if (tl > r || l > tr) return 0;
  if (tl >= l && tr <= r) return t[v];
  int tm = (tl + tr) / 2;
  return get(l, r, v * 2, tl, tm) + get(l, r, v * 2 + 1, tm + 1, tr);
}
int main() {
  cin >> n >> m;
  build();
  for (int i = 1; i <= m; i++) {
    int type, l, r, x;
    cin >> type;
    if (type == 1) {
      cin >> l >> r >> x;
      upd(l, r, x);
    } else {
      cin >> l >> r;
      cout << get(l, r) << "\n";
    }
  }
}
