#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
static inline int Rint() {
  struct X {
    int dig[256];
    X() {
      for (int i = '0'; i <= '9'; ++i) dig[i] = 1;
      dig['-'] = 1;
    }
  };
  static X fuck;
  int s = 1, v = 0, c;
  for (; !fuck.dig[c = getchar()];)
    ;
  if (c == '-')
    s = 0;
  else if (fuck.dig[c])
    v = c ^ 48;
  for (; fuck.dig[c = getchar()]; v = v * 10 + (c ^ 48))
    ;
  return s ? v : -v;
}
template <typename T>
static inline void cmax(T& a, const T& b) {
  if (b > a) a = b;
}
template <typename T>
static inline void cmin(T& a, const T& b) {
  if (b < a) a = b;
}
const int maxn = 100005;
long long delta[maxn << 2];
int mark[maxn << 2];
long long sum[maxn << 2];
void bc(int root, int l, int r) {
  if (l == r) {
    mark[root] = l;
    return;
  } else {
    const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
    bc(lc, l, mid);
    bc(rc, mid + 1, r);
  }
}
long long query(int root, int l, int r, int a, int b) {
  if (a == l && b == r) return sum[root];
  const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
  if (b <= mid) return query(lc, l, mid, a, b) + delta[root] * (b - a + 1);
  if (a > mid) return query(rc, mid + 1, r, a, b) + delta[root] * (b - a + 1);
  return query(lc, l, mid, a, mid) + query(rc, mid + 1, r, mid + 1, b) +
         delta[root] * (b - a + 1);
}
void push_down(int root, int l, int r, int x) {
  if (mark[root] > 0) {
    delta[root] += abs(mark[root] - x);
    sum[root] += 1LL * abs(mark[root] - x) * (r - l + 1);
  } else {
    const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
    push_down(lc, l, mid, x);
    push_down(rc, mid + 1, r, x);
    sum[root] = sum[lc] + sum[rc] + 1LL * delta[root] * (r - l + 1);
  }
  mark[root] = 0;
}
void update(int root, int l, int r, int a, int b, int x) {
  if (a == l && r == b) {
    push_down(root, l, r, x);
    mark[root] = x;
    return;
  }
  const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
  if (mark[root] > 0) {
    mark[lc] = mark[rc] = mark[root];
    mark[root] = 0;
  }
  if (b <= mid)
    update(lc, l, mid, a, b, x);
  else if (a > mid)
    update(rc, mid + 1, r, a, b, x);
  else
    update(lc, l, mid, a, mid, x), update(rc, mid + 1, r, mid + 1, b, x);
  sum[root] = sum[lc] + sum[rc] + 1LL * delta[root] * (r - l + 1);
}
int main() {
  const int n = Rint(), m = Rint();
  bc(1, 1, n);
  for (int i = (0); i < (m); ++i) {
    const int cmd = Rint(), l = Rint(), r = Rint();
    if (cmd == 1) {
      const int x = Rint();
      update(1, 1, n, l, r, x);
    } else {
      printf("%I64d\n", query(1, 1, n, l, r));
    }
  }
  return 0;
}
