#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 123;
const int inf = 1e9;
const long double Pi = acos(-1);
const int mod = 95542721;
const long long Inf = 1e18;
struct node {
  long long ans, add;
  int col;
} t[N * 4];
int n, m;
void push(int v, int tl, int tr) {
  t[v].ans += 1ll * (tr - tl + 1) * t[v].add;
  if (tl != tr) {
    t[v * 2].add += t[v].add;
    t[v * 2 + 1].add += t[v].add;
  }
  t[v].add = 0;
  if (t[v].col) {
    t[v * 2].col = t[v * 2 + 1].col = t[v].col;
  }
}
void upd(int l, int r, int x, int v = 1, int tl = 1, int tr = n) {
  push(v, tl, tr);
  if (tl > r || tr < l) return;
  if (l <= tl && tr <= r && t[v].col) {
    t[v].add += abs(x - t[v].col);
    t[v].col = x;
    push(v, tl, tr);
    return;
  }
  int tm = (tl + tr) / 2;
  upd(l, r, x, v * 2, tl, tm);
  upd(l, r, x, v * 2 + 1, tm + 1, tr);
  if (t[v * 2].col == t[v * 2 + 1].col)
    t[v].col = t[v * 2].col;
  else
    t[v].col = 0;
  t[v].ans = t[v * 2].ans + t[v * 2 + 1].ans;
}
long long get(int l, int r, int v = 1, int tl = 1, int tr = n) {
  push(v, tl, tr);
  if (tl > r || tr < l) return 0;
  if (l <= tl && tr <= r) return t[v].ans;
  int tm = (tl + tr) / 2;
  return get(l, r, v * 2, tl, tm) + get(l, r, v * 2 + 1, tm + 1, tr);
}
void build(int v = 1, int tl = 1, int tr = n) {
  if (tl == tr) {
    t[v].col = tl;
    return;
  }
  int tm = (tl + tr) / 2;
  build(v * 2, tl, tm);
  build(v * 2 + 1, tm + 1, tr);
}
int main() {
  srand(time(0));
  cin >> n >> m;
  build();
  for (int it = 0, t, l, r; it < m; it++) {
    cin >> t >> l >> r;
    if (t == 1) {
      int x;
      cin >> x;
      upd(l, r, x);
    } else {
      cout << get(l, r) << endl;
    }
  }
  return 0;
}
