#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 100 * 1000 + 16;
int n, q;
ll t[N];
ll z[N];
int c[N];
int a[N];
ll v[N];
int ql, qr;
void build(int i, int l, int r) {
  if (r - l + 1 <= 717) {
    for (int j = l; j <= r; ++j) a[j] = j;
  } else {
    int m = (l + r) >> 1;
    build(2 * i, l, m);
    build(2 * i + 1, m + 1, r);
  }
}
inline void push(int i, int l, int r) {
  if (!z[i] || r - l + 1 <= 717) return;
  if (c[i]) {
    c[2 * i] = c[i];
    c[2 * i + 1] = c[i];
  }
  int m = (l + r) >> 1;
  t[2 * i] += z[i] * (m - l + 1);
  t[2 * i + 1] += z[i] * (r - m);
  z[2 * i] += z[i];
  z[2 * i + 1] += z[i];
  z[i] = 0;
}
void update(int i, int l, int r, int x) {
  push(i, l, r);
  if (c[i] == x) {
    return;
  } else if (ql <= l && r <= qr && c[i]) {
    ll v = abs(x - c[i]);
    c[i] = x;
    t[i] += v * (r - l + 1);
    z[i] += v;
  } else if (r - l + 1 <= 717) {
    int co = c[i];
    c[i] = x;
    for (int j = l; j <= r; ++j) {
      a[j] = co ?: a[j];
      if (ql <= j && j <= qr) {
        int d = abs(a[j] - x);
        a[j] = x;
        v[j] += d;
        t[i] += d;
      } else {
        c[i] *= (a[j] == x);
      }
    }
  } else {
    int m = (l + r) >> 1;
    if (ql <= m) update(2 * i, l, m, x);
    if (m < qr) update(2 * i + 1, m + 1, r, x);
    int lf = c[2 * i];
    int rg = c[2 * i + 1];
    c[i] = (lf && lf == rg) ? lf : 0;
    t[i] = t[2 * i] + t[2 * i + 1];
  }
}
void update(int l, int r, int x) {
  ql = l, qr = r;
  update(1, 1, n, x);
}
ll query(int i, int l, int r) {
  push(i, l, r);
  if (ql <= l && r <= qr) {
    return t[i];
  } else if (r - l + 1 <= 717) {
    l = max(l, ql);
    r = min(r, qr);
    ll x = z[i] * (r - l + 1);
    for (int j = l; j <= r; ++j) x += v[j];
    return x;
  } else {
    int m = (l + r) >> 1;
    ll x = (ql <= m) ? query(2 * i, l, m) : 0;
    x += (m < qr) ? query(2 * i + 1, m + 1, r) : 0;
    return x;
  }
}
ll query(int l, int r) {
  ql = l, qr = r;
  return query(1, 1, n);
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) a[i] = i;
  build(1, 1, n);
  while (q--) {
    int t, l, r;
    cin >> t >> l >> r;
    if (t == 1) {
      int x;
      cin >> x;
      update(l, r, x);
    } else {
      cout << query(l, r) << '\n';
    }
  }
  cout.flush();
}
