#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, q;
long long sum[N << 2], delta[N << 2], mark[N << 2];
void init() {
  memset(sum, 0, sizeof(sum));
  memset(delta, 0, sizeof(delta));
  memset(mark, 0, sizeof(mark));
}
void build(int l, int r, int rt) {
  if (l == r) {
    mark[rt] = l;
  } else {
    int m = (l + r) >> 1;
    build(l, m, rt << 1);
    build(m + 1, r, rt << 1 | 1);
    mark[rt] = 0;
  }
}
void pushdown(long long x, int l, int r, int rt) {
  if (mark[rt] > 0) {
    delta[rt] += (long long)abs(mark[rt] - x);
    sum[rt] += (long long)abs(mark[rt] - x) * (long long)(r - l + 1);
    mark[rt] = -1;
  } else {
    int m = (l + r) >> 1;
    pushdown(x, l, m, rt << 1);
    pushdown(x, m + 1, r, rt << 1 | 1);
    sum[rt] =
        sum[rt << 1] + sum[rt << 1 | 1] + delta[rt] * (long long)(r - l + 1);
  }
}
void update(int L, int R, long long x, int l, int r, int rt) {
  if (L <= l && r <= R) {
    pushdown(x, l, r, rt);
    mark[rt] = x;
  } else {
    if (mark[rt] > 0)
      mark[rt << 1] = mark[rt << 1 | 1] = mark[rt], mark[rt] = 0;
    int m = (l + r) >> 1;
    if (m >= L) update(L, R, x, l, m, rt << 1);
    if (m < R) update(L, R, x, m + 1, r, rt << 1 | 1);
    sum[rt] =
        sum[rt << 1] + sum[rt << 1 | 1] + delta[rt] * (long long)(r - l + 1);
  }
}
long long qurry(int L, int R, int l, int r, int rt) {
  if (L <= l && r <= R) return sum[rt];
  long long ret = 0;
  int m = (l + r) >> 1;
  if (m >= L) ret += qurry(L, R, l, m, rt << 1);
  if (m < R) ret += qurry(L, R, m + 1, r, rt << 1 | 1);
  return ret + delta[rt] * (long long)(min(r, R) - max(L, l) + 1);
}
int main() {
  ios::sync_with_stdio(false);
  while (scanf("%d %d", &n, &q) != EOF) {
    init();
    build(1, n, 1);
    int op, a, b, c;
    while (q--) {
      scanf("%d %d %d", &op, &a, &b);
      if (op == 1) {
        scanf("%d", &c);
        update(a, b, c, 1, n, 1);
      } else {
        printf("%I64d\n", qurry(a, b, 1, n, 1));
      }
    }
  }
  return 0;
}
