#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000 * 1000 * 1000 + 7;
const long long NMAX = 1000 * 1000 + 11;
long long col[NMAX], lazy[NMAX], ans[NMAX];
long long n, m, p, q, k;
void build(long long l, long long r, long long p) {
  if (l == r) {
    col[p] = l + 1;
    return;
  }
  build(l, (l + r) / 2, 2 * p);
  build((l + r) / 2 + 1, r, 2 * p + 1);
  return;
}
void check(long long p, long long l, long long r) {
  if (!lazy[p]) return;
  col[2 * p] = col[p];
  col[2 * p + 1] = col[p];
  long long mid = (l + r) >> 1LL;
  ans[2 * p] += (lazy[p]) * (mid - l + 1);
  ans[2 * p + 1] += (lazy[p]) * (r - mid);
  if (l != r) {
    lazy[2 * p] += lazy[p];
    lazy[2 * p + 1] += lazy[p];
  }
  lazy[p] = 0;
  return;
}
void update(long long p, long long l, long long r, long long qs, long long qe,
            long long x) {
  check(p, l, r);
  if (l > qe || r < qs) return;
  if (qs <= l and r <= qe) {
    if (col[p]) {
      ans[p] += abs(col[p] - x) * (r - l + 1);
      lazy[p] += abs(col[p] - x);
      col[p] = x;
    } else {
      long long mid = (l + r) / 2;
      update(2 * p, l, mid, qs, qe, x);
      update(2 * p + 1, mid + 1, r, qs, qe, x);
      ans[p] = ans[2 * p] + ans[2 * p + 1];
      col[p] = x;
    }
    return;
  }
  long long mid = (l + r) / 2;
  update(p * 2, l, mid, qs, qe, x);
  update(p * 2 + 1, mid + 1, r, qs, qe, x);
  ans[p] = ans[p * 2] + ans[p * 2 + 1];
  col[p] = col[p * 2] == col[p * 2 + 1] ? col[p * 2] : 0;
  return;
}
long long query(long long p, long long l, long long r, long long qs,
                long long qe) {
  check(p, l, r);
  if (l > qe || qs > r) return 0;
  if (qs <= l and r <= qe) return ans[p];
  long long mid = (l + r) / 2;
  return query(p * 2, l, mid, qs, qe) + query(p * 2 + 1, mid + 1, r, qs, qe);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  build(0, n - 1, 1);
  long long type, l, r, x;
  while (m--) {
    cin >> type;
    if (type == 2) {
      cin >> l >> r;
      cout << query(1, 0, n - 1, l - 1, r - 1) << "\n";
    } else {
      cin >> l >> r >> x;
      update(1, 0, n - 1, l - 1, r - 1, x);
    }
  }
  return 0;
}
