#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
long long col[MAXN << 2], chg[MAXN << 2], sum[MAXN << 2];
void push_down(int n, int len) {
  if (col[n]) {
    chg[n << 1] += chg[n];
    chg[n << 1 | 1] += chg[n];
    sum[n << 1] += chg[n] * (len - (len >> 1));
    sum[n << 1 | 1] += chg[n] * (len >> 1);
    col[n << 1] = col[n];
    col[n << 1 | 1] = col[n];
    col[n] = chg[n] = 0;
  }
}
void push_up(int n) {
  if (col[n << 1] == col[n << 1 | 1]) col[n] = col[n << 1];
  sum[n] = sum[n << 1] + sum[n << 1 | 1];
}
void build(int L, int R, int n) {
  sum[n] = 0;
  if (L == R) {
    col[n] = L;
    return;
  }
  int mid = (L + R) >> 1;
  build(L, mid, n << 1);
  build(mid + 1, R, n << 1 | 1);
}
void modify(int L, int R, int n, int ls, int rs, int val) {
  if (ls <= L && R <= rs && col[n]) {
    chg[n] += abs(col[n] - val);
    sum[n] += abs(col[n] - val) * (R - L + 1);
    col[n] = val;
    return;
  }
  push_down(n, R - L + 1);
  int mid = (L + R) >> 1;
  if (ls <= mid) modify(L, mid, n << 1, ls, rs, val);
  if (rs > mid) modify(mid + 1, R, n << 1 | 1, ls, rs, val);
  push_up(n);
}
long long query(int L, int R, int n, int ls, int rs) {
  if (ls <= L && R <= rs) {
    return sum[n];
  }
  push_down(n, R - L + 1);
  int mid = (L + R) >> 1;
  long long ret = 0;
  if (ls <= mid) ret += query(L, mid, n << 1, ls, rs);
  if (rs > mid) ret += query(mid + 1, R, n << 1 | 1, ls, rs);
  return ret;
}
int main() {
  int n, m;
  int t, l, r, x;
  scanf("%d%d", &n, &m);
  build(1, n, 1);
  while (m--) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d%d%d", &l, &r, &x);
      modify(1, n, 1, l, r, x);
    } else {
      scanf("%d%d", &l, &r);
      printf("%lld\n", query(1, n, 1, l, r));
    }
  }
  return 0;
}
