#include <bits/stdc++.h>
using namespace std;
long long int pw(long long int a, long long int b, long long int mod) {
  if (!b) return 1;
  if (b & 1) return a * pw(a * a % mod, b / 2, mod) % mod;
  return pw(a * a % mod, b / 2, mod) % mod;
}
const long long int MAXN = 1e5 + 10;
const long long int INF = 8e18;
const long long int MOD = 1e9 + 7;
long long int n, q, seg[MAXN << 2][3], lazy[MAXN << 2][2];
void build(int id, int l, int r) {
  if (r - l == 1) {
    seg[id][1] = seg[id][2] = r;
    return;
  }
  int mid = (l + r) >> 1;
  build(2 * id, l, mid);
  build(2 * id + 1, mid, r);
  seg[id][1] = min(seg[2 * id][1], seg[2 * id + 1][1]);
  seg[id][2] = max(seg[2 * id][2], seg[2 * id + 1][2]);
}
void shift(int id, int l, int r) {
  if (lazy[id][0] == 0) return;
  seg[id][0] += lazy[id][1] * (r - l);
  seg[id][1] = seg[id][2] = lazy[id][0];
  if (r - l > 1) {
    lazy[2 * id][1] += lazy[id][1];
    lazy[2 * id + 1][1] += lazy[id][1];
    lazy[2 * id][0] = lazy[2 * id + 1][0] = lazy[id][0];
  }
  lazy[id][0] = lazy[id][1] = 0;
}
void update(int id, int l, int r, int ql, int qr, long long int x) {
  shift(id, l, r);
  if (qr <= l || r <= ql) return;
  if (ql <= l && r <= qr && seg[id][1] == seg[id][2]) {
    lazy[id][0] = x;
    lazy[id][1] = abs(x - seg[id][1]);
    return shift(id, l, r);
  }
  int mid = (l + r) >> 1;
  update(2 * id, l, mid, ql, qr, x);
  update(2 * id + 1, mid, r, ql, qr, x);
  seg[id][0] = seg[2 * id][0] + seg[2 * id + 1][0];
  seg[id][1] = min(seg[2 * id][1], seg[2 * id + 1][1]);
  seg[id][2] = max(seg[2 * id][2], seg[2 * id + 1][2]);
}
long long int get(int id, int l, int r, int ql, int qr) {
  shift(id, l, r);
  if (qr <= l || r <= ql) return 0;
  if (ql <= l && r <= qr) return seg[id][0];
  int mid = (l + r) >> 1;
  return get(2 * id, l, mid, ql, qr) + get(2 * id + 1, mid, r, ql, qr);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n >> q;
  build(1, 0, n);
  while (q--) {
    int type, l, r, x;
    cin >> type >> l >> r;
    if (type == 1) {
      cin >> x;
      update(1, 0, n, l - 1, r, x);
    } else {
      cout << get(1, 0, n, l - 1, r) << '\n';
    }
  }
  return 0;
}
