#include <bits/stdc++.h>
long long fabs(long long x) {
  if (x < 0) return -x;
  return x;
}
class SegTree {
 private:
  struct segtree {
    int l, r;
    long long v, happiness, mark;
  } seg[100005 << 2];

 public:
  void pushup(int rt) {
    seg[rt].happiness = seg[rt << 1].happiness + seg[rt << 1 | 1].happiness;
    if (seg[rt << 1].v == seg[rt << 1 | 1].v) {
      seg[rt].v = seg[rt << 1].v;
    } else
      seg[rt].v = 0;
  }
  void pushdown(int rt) {
    if (seg[rt].mark) {
      int mid = (seg[rt].r + seg[rt].l) >> 1;
      seg[rt << 1].happiness += seg[rt].mark * (mid - seg[rt].l + 1);
      seg[rt << 1 | 1].happiness += seg[rt].mark * (seg[rt].r - mid);
      seg[rt << 1].mark += seg[rt].mark;
      seg[rt << 1 | 1].mark += seg[rt].mark;
      seg[rt << 1].v = seg[rt << 1 | 1].v = seg[rt].v;
      seg[rt].mark = 0;
      seg[rt].v = 0;
    }
  }
  void build(int l, int r, int rt) {
    seg[rt].happiness = 0;
    seg[rt].mark = 0;
    seg[rt].v = 0;
    seg[rt].l = l;
    seg[rt].r = r;
    if (l == r) {
      seg[rt].v = l;
      return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    pushup(rt);
  }
  void update(int L, int R, int rt, int v) {
    if (seg[rt].l >= L && seg[rt].r <= R) {
      if (seg[rt].v) {
        seg[rt].happiness += fabs(v - seg[rt].v) * (seg[rt].r - seg[rt].l + 1);
        seg[rt].mark += fabs(v - seg[rt].v);
        seg[rt].v = v;
        return;
      }
    }
    pushdown(rt);
    int mid = (seg[rt].l + seg[rt].r) >> 1;
    if (L <= mid) update(L, R, rt << 1, v);
    if (R > mid) update(L, R, rt << 1 | 1, v);
    pushup(rt);
  }
  long long query(int L, int R, int rt) {
    if (seg[rt].l >= L && seg[rt].r <= R) {
      return seg[rt].happiness;
    }
    pushdown(rt);
    long long a1 = 0, a2 = 0;
    int mid = (seg[rt].l + seg[rt].r) >> 1;
    if (L <= mid) a1 = query(L, R, rt << 1);
    if (R > mid) a2 = query(L, R, rt << 1 | 1);
    pushup(rt);
    return a1 + a2;
  }
} T;
int main() {
  int n, m, type, l, r, v;
  while (~scanf("%d%d", &n, &m)) {
    T.build(1, n, 1);
    while (m--) {
      scanf("%d", &type);
      if (type == 1) {
        scanf("%d%d%d", &l, &r, &v);
        T.update(l, r, 1, v);
      } else {
        scanf("%d%d", &l, &r);
        printf("%I64d\n", T.query(l, r, 1));
      }
    }
  }
}
