#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int32_t x;
  scanf("%d", &x);
  return x;
}
inline string get() {
  char ch[10];
  scanf("%s", ch);
  return ch;
}
template <class P, class Q>
inline P smin(P &a, Q b) {
  if (b < a) a = b;
  return a;
}
template <class P, class Q>
inline P smax(P &a, Q b) {
  if (a < b) a = b;
  return a;
}
const long long maxn = 1e5 + 10;
const long long base = 29;
const long long MAX_LG = 21;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const long long maxq = 2e5 + 10;
long long a[maxn], flat[4 * maxn], lazy[4 * maxn], stree[4 * maxn];
inline void build(long long p, long long l, long long r) {
  if (l == r) {
    flat[p] = a[l];
    return;
  }
  long long mid = (l + r) >> 1;
  build(2 * p + 1, l, mid);
  build(2 * p + 2, mid + 1, r);
  flat[p] = 0;
}
inline void clear(long long p, long long l, long long r, long long val) {
  if (flat[p]) {
    stree[p] += abs(flat[p] - val) * (r - l + 1);
    lazy[p] += abs(flat[p] - val);
  } else {
    long long mid = (l + r) >> 1;
    clear(2 * p + 1, l, mid, val), clear(2 * p + 2, mid + 1, r, val);
    stree[p] = stree[2 * p + 1] + stree[2 * p + 2] + lazy[p] * (r - l + 1);
  }
}
inline void update(long long p, long long l, long long r, long long x,
                   long long y, long long val) {
  if (l > y || r < x) return;
  if (l >= x && r <= y) {
    clear(p, l, r, val);
    flat[p] = val;
    return;
  }
  long long mid = (l + r) >> 1;
  if (flat[p]) flat[2 * p + 1] = flat[2 * p + 2] = flat[p], flat[p] = 0;
  update(2 * p + 1, l, mid, x, y, val),
      update(2 * p + 2, mid + 1, r, x, y, val);
  stree[p] = stree[2 * p + 1] + stree[2 * p + 2] + lazy[p] * (r - l + 1);
}
inline long long get(long long p, long long l, long long r, long long x,
                     long long y) {
  if (l > y || r < x) return 0;
  if (l >= x && r <= y) return stree[p];
  long long mid = (l + r) >> 1;
  return get(2 * p + 1, l, mid, x, y) + get(2 * p + 2, mid + 1, r, x, y) +
         lazy[p] * (min(r, y) - max(l, x) + 1);
}
int32_t main() {
  long long n = in(), q = in();
  for (long long i = 0; i < n; i++) a[i] = i + 1;
  build(0, 0, n - 1);
  while (q--) {
    long long tp = in(), l = in() - 1, r = in() - 1;
    if (tp == 1) {
      long long x = in();
      update(0, 0, n - 1, l, r, x);
    } else
      cout << get(0, 0, n - 1, l, r) << "\n";
  }
}
