#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const long long mod = 1e9 + 7;
const int max_n = 101000;
int n, m;
long long input[max_n];
long long seg[4 * max_n];
long long ness[4 * max_n];
long long lazy[4 * max_n];
void construct(int lo = 1, int hi = n, int id = 1) {
  if (lo == hi) {
    seg[id] = lo;
    return;
  }
  int mid = (lo + hi) / 2;
  construct(lo, mid, 2 * id);
  construct(mid + 1, hi, 2 * id + 1);
}
void push_down(int lo, int hi, int id) {
  if (lazy[id] == 0) return;
  int mid = (lo + hi) / 2;
  ness[id * 2] += 1ll * (mid - lo + 1) * lazy[id];
  ness[id * 2 + 1] += 1ll * (hi - mid) * lazy[id];
  seg[2 * id] = seg[2 * id + 1] = seg[id];
  lazy[2 * id] += lazy[id];
  lazy[2 * id + 1] += lazy[id];
  lazy[id] = 0;
}
void modify(int l, int r, int lo, int hi, int id, long long x) {
  if (r < lo || l > hi) return;
  if (lo >= l && hi <= r) {
    if (seg[id] != 0) {
      ness[id] += 1ll * (hi - lo + 1) * abs(x - seg[id]);
      lazy[id] += abs(x - seg[id]);
      seg[id] = x;
      return;
    }
    int mid = (lo + hi) / 2;
    modify(l, r, lo, mid, 2 * id, x);
    modify(l, r, mid + 1, hi, 2 * id + 1, x);
    seg[id] = x;
    ness[id] = ness[id * 2] + ness[id * 2 + 1];
    return;
  }
  push_down(lo, hi, id);
  int mid = (lo + hi) / 2;
  modify(l, r, lo, mid, 2 * id, x);
  modify(l, r, mid + 1, hi, 2 * id + 1, x);
  seg[id] = (seg[id * 2] == seg[id * 2 + 1]) ? seg[id * 2] : 0;
  ness[id] = ness[id * 2] + ness[id * 2 + 1];
}
long long query(int l, int r, int lo = 1, int hi = n, int id = 1) {
  if (r < lo || l > hi) return 1ll * 0;
  if (lo >= l && hi <= r) return ness[id];
  int mid = (lo + hi) / 2;
  push_down(lo, hi, id);
  return query(l, r, lo, mid, 2 * id) + query(l, r, mid + 1, hi, 2 * id + 1);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) input[i] = i;
  for (int i = 1; i <= 4 * n; i++) seg[i] = ness[i] = lazy[i] = 0;
  construct();
  int t, l, r;
  long long x;
  for (int i = 0; i < m; i++) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d %d %I64d", &l, &r, &x);
      modify(l, r, 1, n, 1, x);
    } else {
      scanf("%d %d", &l, &r);
      printf("%I64d\n", query(l, r));
    }
  }
}
