#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
long long tree[N], lazy[N];
void updateRange(int node, int start, int end, int l, int r, long long val) {
  if (lazy[node] != 0) {
    tree[node] += (end - start + 1) * lazy[node];
    if (start != end) {
      lazy[node * 2] += lazy[node];
      lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
  }
  if (start > end or start > r or end < l) return;
  if (start >= l and end <= r) {
    tree[node] += (end - start + 1) * val;
    if (start != end) {
      lazy[node * 2] += val;
      lazy[node * 2 + 1] += val;
    }
    return;
  }
  int mid = (start + end) / 2;
  updateRange(node * 2, start, mid, l, r, val);
  updateRange(node * 2 + 1, mid + 1, end, l, r, val);
  tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
long long queryRange(int node, int start, int end, int l, int r) {
  if (start > end or start > r or end < l) return 0;
  if (lazy[node] != 0) {
    tree[node] += (end - start + 1) * lazy[node];
    if (start != end) {
      lazy[node * 2] += lazy[node];
      lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
  }
  if (start >= l and end <= r) return tree[node];
  int mid = (start + end) / 2;
  long long p1 = queryRange(node * 2, start, mid, l, r);
  long long p2 = queryRange(node * 2 + 1, mid + 1, end, l, r);
  return (p1 + p2);
}
int n, m;
set<pair<int, pair<int, int> > > st;
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) st.insert(make_pair(i, make_pair(i, i)));
  while (m--) {
    int tp, l, r, x;
    scanf("%d", &tp);
    if (tp == 1) {
      scanf("%d %d %d", &l, &r, &x);
      auto it = st.lower_bound(make_pair(l, make_pair(0, 0)));
      pair<int, pair<int, int> > A, B;
      vector<pair<int, pair<int, int> > > vec;
      A = *it;
      A.first = l - 1;
      while (it != st.end() and it->second.first <= r) {
        int L = max(l, it->second.first);
        int R = min(r, it->first);
        int V = (((it->second.second) - x) < 0 ? -((it->second.second) - x)
                                               : ((it->second.second) - x));
        updateRange(1, 1, n, L, R, V);
        B = *it;
        B.second.first = r + 1;
        vec.push_back(*it);
        it++;
      }
      for (int i = 0; i < vec.size(); i++) st.erase(vec[i]);
      if (A.second.first <= A.first) st.insert(A);
      if (B.second.first <= B.first) st.insert(B);
      st.insert(make_pair(r, make_pair(l, x)));
    } else {
      scanf("%d %d", &l, &r);
      long long ans = queryRange(1, 1, n, l, r);
      printf("%I64d\n", ans);
    }
  }
}
