#include <bits/stdc++.h>
using namespace std;
struct tree {
  long long sum, add, col;
};
tree seg[411111];
void build(long long tren, long long l, long long d) {
  if (l > d) return;
  if (d == l) {
    seg[tren].sum = 0;
    seg[tren].col = l;
    seg[tren].add = 0;
    return;
  }
  build(tren * 2, l, (l + d) / 2);
  build(tren * 2 + 1, 1 + (l + d) / 2, d);
  seg[tren].sum = seg[tren * 2].sum + seg[tren * 2 + 1].sum;
  seg[tren].add = 0;
  if (seg[tren * 2].col == seg[tren * 2 + 1].col)
    seg[tren].col = seg[tren * 2].col;
  else
    seg[tren].col = -1;
}
void update(long long tren, long long l, long long d, long long i, long long j,
            long long x) {
  if (l > d || d < i || l > j) return;
  if (i <= l && d <= j) {
    if (seg[tren].col > 0) {
      seg[tren].sum += abs(seg[tren].col - x) * (d - l + 1);
      seg[tren].add += abs(seg[tren].col - x);
      seg[tren].col = x;
      return;
    }
    update(tren * 2, l, (l + d) / 2, i, j, x);
    update(tren * 2 + 1, 1 + (l + d) / 2, d, i, j, x);
    seg[tren].sum = seg[tren * 2].sum + seg[tren * 2 + 1].sum;
    seg[tren].col = x;
    return;
  }
  if (l != d && seg[tren].col > 0) {
    long long mid = (l + d) / 2;
    seg[tren * 2].sum += seg[tren].add * (mid - l + 1);
    seg[tren * 2].add += seg[tren].add;
    seg[tren * 2].col = seg[tren].col;
    seg[tren * 2 + 1].sum += seg[tren].add * (d - mid);
    seg[tren * 2 + 1].add += seg[tren].add;
    seg[tren * 2 + 1].col = seg[tren].col;
    seg[tren].add = 0;
  }
  update(tren * 2, l, (l + d) / 2, i, j, x);
  update(tren * 2 + 1, 1 + (l + d) / 2, d, i, j, x);
  seg[tren].sum = seg[tren * 2].sum + seg[tren * 2 + 1].sum;
  if (seg[tren * 2].col == seg[tren * 2 + 1].col)
    seg[tren].col = seg[tren * 2].col;
  else
    seg[tren].col = -1;
}
long long query(long long tren, long long l, long long d, long long i,
                long long j) {
  if (l > d || d < i || l > j) return 0;
  if (i <= l && d <= j) return seg[tren].sum;
  if (l != d && seg[tren].col > 0) {
    long long mid = (l + d) / 2;
    seg[tren * 2].sum += seg[tren].add * (mid - l + 1);
    seg[tren * 2].add += seg[tren].add;
    seg[tren * 2].col = seg[tren].col;
    seg[tren * 2 + 1].sum += seg[tren].add * (d - mid);
    seg[tren * 2 + 1].add += seg[tren].add;
    seg[tren * 2 + 1].col = seg[tren].col;
    seg[tren].add = 0;
  }
  long long left = query(tren * 2, l, (l + d) / 2, i, j);
  long long right = query(tren * 2 + 1, 1 + (l + d) / 2, d, i, j);
  return (left + right);
}
int main() {
  long long n, m;
  scanf("%lld%lld", &n, &m);
  build(1, 1, n);
  while (m--) {
    long long t, l, r, x;
    scanf("%lld", &t);
    if (t == 1) {
      scanf("%lld%lld%lld", &l, &r, &x);
      update(1, 1, n, l, r, x);
    } else {
      scanf("%lld%lld", &l, &r);
      printf("%lld\n", query(1, 1, n, l, r));
    }
  }
  return 0;
}
