#include <bits/stdc++.h>
using namespace std;
const long long N = 100010;
const long long M = 320;
const long long INF = 0x3f3f3f3f;
const long long iinf = 1 << 30;
const long long linf = 2e18;
const long long MOD = 1000000007;
const double eps = 1e-7;
void print(long long x) {
  cout << x << endl;
  exit(0);
}
void PRINT(string x) {
  cout << x << endl;
  exit(0);
}
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
long long n, m, len, num;
long long a[N], b[N], bl[N], l[M], r[M], flg[M], flg2[M], sum[M];
void build() {
  len = sqrt(n);
  num = (n - 1) / len + 1;
  for (long long i = (1); i <= (n); i++) bl[i] = (i - 1) / len + 1;
  for (long long i = (1); i <= (num); i++)
    l[i] = (i - 1) * len + 1, r[i] = i * len;
  r[num] = n;
  for (long long i = (1); i <= (num); i++) flg[i] = -1;
}
void down(long long x) {
  for (long long i = (l[x]); i <= (r[x]); i++) a[i] = flg[x];
  flg[x] = -1;
}
void modify(long long x, long long y, long long val) {
  if (bl[x] == bl[y]) {
    if (flg[bl[x]] != -1) down(bl[x]);
    for (long long i = (x); i <= (y); i++) {
      b[i] += abs(a[i] - val);
      sum[bl[x]] += abs(a[i] - val);
      a[i] = val;
    }
  } else {
    if (flg[bl[x]] != -1) down(bl[x]);
    for (long long i = (x); i <= (r[bl[x]]); i++) {
      b[i] += abs(val - a[i]);
      sum[bl[x]] += abs(val - a[i]);
      a[i] = val;
    }
    for (long long i = (bl[x] + 1); i <= (bl[y] - 1); i++) {
      if (flg[i] != -1) {
        flg2[i] += abs(flg[i] - val);
        sum[i] += abs(flg[i] - val) * (r[i] - l[i] + 1);
        flg[i] = val;
      } else {
        for (long long j = (l[i]); j <= (r[i]); j++) {
          b[j] += abs(val - a[j]);
          sum[i] += abs(val - a[j]);
          a[j] = val;
        }
        flg[i] = val;
      }
    }
    if (flg[bl[y]] != -1) down(bl[y]);
    for (long long i = (l[bl[y]]); i <= (y); i++) {
      b[i] += abs(a[i] - val);
      sum[bl[y]] += abs(a[i] - val);
      a[i] = val;
    }
  }
}
long long query(long long x, long long y) {
  long long ans = 0;
  if (bl[x] == bl[y]) {
    for (long long i = (x); i <= (y); i++) ans += b[i] + flg2[bl[i]];
  } else {
    for (long long i = (x); i <= (r[bl[x]]); i++) ans += b[i] + flg2[bl[i]];
    for (long long i = (bl[x] + 1); i <= (bl[y] - 1); i++) ans += sum[i];
    for (long long i = (l[bl[y]]); i <= (y); i++) ans += b[i] + flg2[bl[i]];
  }
  return ans;
}
signed main() {
  scanf("%lld%lld", &n, &m);
  for (long long i = (1); i <= (n); i++) a[i] = i;
  build();
  while (m--) {
    long long op, l, r, val;
    scanf("%lld%lld%lld", &op, &l, &r);
    if (op == 1) {
      scanf("%lld", &val);
      modify(l, r, val);
    } else {
      printf("%lld\n", query(l, r));
    }
  }
  return 0;
}
