#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int maxm = 400010;
const int INF = 0x3f3f3f3f;
const long long LINF = 3e17 + 1;
const int mod = 1e9 + 7;
int n, r, c, m;
inline int read() {
  register int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return (f == 1) ? x : -x;
}
struct seg_tree {
  long long l, r;
  long long sum;
  long long num;
  long long lz;
} tr[maxn << 2];
void pushup(long long o) {
  tr[o].sum = tr[(o << 1)].sum + tr[(o << 1 | 1)].sum;
  if (tr[(o << 1)].num == tr[(o << 1 | 1)].num)
    tr[o].num = tr[(o << 1)].num;
  else
    tr[o].num = 0;
}
void pushdown(long long o) {
  if (tr[o].lz) {
    long long mid = (tr[o].l + tr[o].r) >> 1;
    tr[(o << 1)].sum += (mid - tr[o].l + 1) * tr[o].lz;
    tr[(o << 1 | 1)].sum += (tr[o].r - mid) * tr[o].lz;
    tr[(o << 1)].num = tr[(o << 1 | 1)].num = tr[o].num;
    tr[(o << 1)].lz += tr[o].lz;
    tr[(o << 1 | 1)].lz += tr[o].lz;
    tr[o].lz = 0;
  }
}
void build(long long o, long long l, long long r) {
  tr[o].l = l, tr[o].r = r, tr[o].lz = 0, tr[o].sum = 0;
  if (l == r) {
    tr[o].num = l;
    return;
  }
  long long mid = (l + r) >> 1;
  build((o << 1), l, mid);
  build((o << 1 | 1), mid + 1, r);
  pushup(o);
}
void update(long long o, long long l, long long r, long long ql, long long qr,
            long long val) {
  if (ql <= l && r <= qr && tr[o].num) {
    tr[o].sum += (r - l + 1) * abs(val - tr[o].num);
    tr[o].lz += abs(val - tr[o].num);
    tr[o].num = val;
    return;
  } else if (l == r) {
    tr[o].sum += abs(val - tr[o].num);
    tr[o].num = val;
    return;
  }
  long long mid = (l + r) >> 1;
  pushdown(o);
  if (ql <= mid) update((o << 1), l, mid, ql, qr, val);
  if (mid < qr) update((o << 1 | 1), mid + 1, r, ql, qr, val);
  pushup(o);
}
long long query(long long o, long long l, long long r, long long ql,
                long long qr) {
  if (ql <= l && r <= qr) {
    return tr[o].sum;
  }
  pushdown(o);
  long long mid = (l + r) >> 1;
  long long res = 0;
  if (ql <= mid) res += query((o << 1), l, mid, ql, qr);
  if (mid < qr) res += query((o << 1 | 1), mid + 1, r, ql, qr);
  return res;
}
int main() {
  ;
  ios::sync_with_stdio(0);
  cin.tie(0);
  ;
  cin >> n >> m;
  build(1, 1, n);
  int opt, l, r;
  long long v;
  while (m--) {
    cin >> opt >> l >> r;
    if (opt == 1) {
      cin >> v;
      update(1, 1, n, l, r, v);
    } else {
      cout << query(1, 1, n, l, r) << endl;
    }
  }
  return 0;
}
