#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long mod = (int)1e9 + 7;
const int N = 2e5 + 100;
int l[N], r[N], belong[N];
long long lz[N], sum[N], v[N], a[N], tmp[N];
int n, m, tot;
void Build() {
  m = sqrt(n);
  tot = n / m;
  if (n % m) tot++;
  for (int i = 1; i <= n; i++) belong[i] = (i - 1) / m + 1, a[i] = i;
  for (int i = 1; i <= tot; i++) l[i] = (i - 1) * m + 1, r[i] = i * m;
  r[tot] = n;
}
void PushDown(int rt) {
  for (int i = l[rt]; i <= r[rt]; i++) a[i] = lz[rt];
  lz[rt] = 0;
}
void Update(int x, int y, long long c) {
  int idx = belong[x], idy = belong[y];
  if (idx == idy) {
    if (lz[idx]) PushDown(idx);
    for (int i = x; i <= y; i++) {
      sum[idx] += abs(c - a[i]);
      v[i] += abs(c - a[i]);
      a[i] = c;
    }
  } else {
    if (lz[idx]) PushDown(idx);
    if (lz[idy]) PushDown(idy);
    for (int i = x; i <= r[idx]; i++) {
      sum[idx] += abs(c - a[i]);
      v[i] += abs(c - a[i]);
      a[i] = c;
    }
    for (int i = l[idy]; i <= y; i++) {
      sum[idy] += abs(c - a[i]);
      v[i] += abs(c - a[i]);
      a[i] = c;
    }
    for (int i = idx + 1; i < idy; i++) {
      if (lz[i]) {
        tmp[i] += abs(lz[i] - c);
        sum[i] += (r[i] - l[i] + 1) * (abs(lz[i] - c));
        lz[i] = c;
      } else {
        lz[i] = c;
        for (int j = l[i]; j <= r[i]; j++) {
          v[j] += abs(a[j] - c);
          sum[i] += abs(a[j] - c);
          a[j] = c;
        }
      }
    }
  }
}
void Query(int x, int y) {
  int idx = belong[x], idy = belong[y];
  long long ans = 0;
  if (idx == idy) {
    for (int i = x; i <= y; i++) ans += (tmp[idx] + v[i]);
  } else {
    for (int i = x; i <= r[idx]; i++) ans += (tmp[idx] + v[i]);
    for (int i = l[idy]; i <= y; i++) ans += (tmp[idy] + v[i]);
    for (int i = idx + 1; i < idy; i++) ans += sum[i];
  }
  printf("%lld\n", ans);
}
int main() {
  int q, x, y, c, op;
  scanf("%d%d", &n, &q);
  Build();
  while (q--) {
    scanf("%d%d%d", &op, &x, &y);
    if (op == 1) {
      scanf("%d", &c);
      Update(x, y, c);
    } else {
      Query(x, y);
    }
  }
  return 0;
}
