#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const long long LINF = 1e18 + 100;
int n, m;
set<int> s;
int col[100100];
long long seg[4 * 100100];
long long lz[4 * 100100];
void pushdown(int v, int l, int r) {
  if (!lz[v]) return;
  int mid = (r + l) / 2;
  lz[2 * v] += lz[v];
  lz[2 * v + 1] += lz[v];
  seg[2 * v] += (mid - l + 1) * lz[v];
  seg[2 * v + 1] += (r - mid) * lz[v];
  lz[v] = 0;
}
void add(int L, int R, long long x, int v = 1, int l = 1, int r = n) {
  if (l > R || r < L) return;
  if (l >= L && r <= R) {
    seg[v] += (r - l + 1) * x;
    lz[v] += x;
    return;
  }
  int mid = (r + l) / 2;
  pushdown(v, l, r);
  add(L, R, x, 2 * v, l, mid);
  add(L, R, x, 2 * v + 1, mid + 1, r);
  seg[v] = seg[2 * v] + seg[2 * v + 1];
}
long long get(int L, int R, int v = 1, int l = 1, int r = n) {
  if (l > R || r < L) return 0;
  if (l >= L && r <= R) return seg[v];
  int mid = (r + l) / 2;
  pushdown(v, l, r);
  return get(L, R, 2 * v, l, mid) + get(L, R, 2 * v + 1, mid + 1, r);
}
int32_t main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m;
  for (int i = (1); i < (n + 1); i++) {
    s.insert(i);
    col[i] = i;
  }
  while (m--) {
    int op, l, r;
    cin >> op >> l >> r;
    if (op == 1) {
      int x;
      cin >> x;
      if (r < n && !s.count(r + 1)) {
        auto it = s.upper_bound(r);
        it--;
        col[r + 1] = col[*it];
        s.insert(r + 1);
      }
      auto it = s.upper_bound(l);
      it--;
      col[l] = col[*it];
      s.insert(l);
      it = s.lower_bound(l);
      while (it != s.end() && *it <= r) {
        auto it2 = it;
        it++;
        int hi = (it == s.end() ? n + 1 : *it);
        add(*it2, hi - 1, abs(col[*it2] - x));
        col[*it2] = x;
        if (*it2 > l) s.erase(it2);
      }
    } else {
      cout << get(l, r) << '\n';
    }
  }
  return 0;
}
