#include <bits/stdc++.h>
using namespace std;
inline long long myAbs(long long x) { return x > 0 ? x : -x; }
int n, m;
class st {
 public:
  vector<long long> c, lazy;
  st() : c(4 * n + 1, 0), lazy(4 * n + 1, 0) {}
  void update(int l, int r, long long v, int nl, int nr, int node) {
    if (l > nr || r < nl) return;
    if (l <= nl && nr <= r) {
      lazy[node] += v;
      c[node] += v * (nr - nl + 1);
      return;
    }
    update(l, r, v, nl, (nl + nr) / 2, node * 2);
    update(l, r, v, (nl + nr) / 2 + 1, nr, node * 2 + 1);
    c[node] = c[node * 2] + c[node * 2 + 1] + lazy[node] * (nr - nl + 1);
  }
  void update(int l, int r, long long v) { update(l, r, v, 1, n, 1); }
  long long query(int l, int r, int nl, int nr, int node) {
    if (l > nr || r < nl) return 0;
    if (l <= nl && nr <= r) {
      return c[node];
    }
    return query(l, r, nl, (nl + nr) / 2, node * 2) +
           query(l, r, (nl + nr) / 2 + 1, nr, node * 2 + 1) +
           lazy[node] * (min(r, nr) - max(l, nl) + 1);
  }
  long long query(int l, int r) { return query(l, r, 1, n, 1); }
};
class painting {
 public:
  st tree;
  set<pair<pair<int, int>, int> > s;
  painting(int n) {
    s = set<pair<pair<int, int>, int> >();
    for (int i = 1; i <= n; i++)
      s.insert(pair<pair<int, int>, int>(pair<int, int>(i, i), i));
  }
  void update(int l, int r, int x) {
    set<pair<pair<int, int>, int> >::iterator lb, rb;
    auto _lb =
        s.lower_bound(pair<pair<int, int>, int>(pair<int, int>(l, l), 0));
    if (_lb->first.first != l) {
      _lb--;
      pair<pair<int, int>, int> that = *_lb;
      s.erase(_lb);
      s.insert(pair<pair<int, int>, int>(
          pair<int, int>(that.first.first, l - 1), that.second));
      s.insert(pair<pair<int, int>, int>(pair<int, int>(l, that.first.second),
                                         that.second));
    }
    auto _rb = s.lower_bound(
        pair<pair<int, int>, int>(pair<int, int>(r + 1, r + 1), 0));
    if (_rb == s.end() || _rb->first.first != r + 1) {
      _rb--;
      pair<pair<int, int>, int> that = *_rb;
      s.erase(_rb);
      s.insert(pair<pair<int, int>, int>(pair<int, int>(that.first.first, r),
                                         that.second));
      s.insert(pair<pair<int, int>, int>(
          pair<int, int>(r + 1, that.first.second), that.second));
    }
    lb = s.lower_bound(pair<pair<int, int>, int>(pair<int, int>(l, l), 0));
    rb = s.lower_bound(
        pair<pair<int, int>, int>(pair<int, int>(r + 1, r + 1), 0));
    for (auto it = lb; it != rb; it++)
      tree.update(it->first.first, it->first.second, myAbs(it->second - x));
    s.erase(lb, rb);
    s.insert(pair<pair<int, int>, int>(pair<int, int>(l, r), x));
  }
  long long query(int l, int r) { return tree.query(l, r); }
};
int main() {
  cin >> n >> m;
  painting p = painting(n);
  while (m--) {
    int t;
    cin >> t;
    if (t == 1) {
      int l, r, x;
      cin >> l >> r >> x;
      p.update(l, r, x);
    } else {
      int l, r;
      cin >> l >> r;
      cout << p.query(l, r) << endl;
    }
  }
}
