#include <bits/stdc++.h>
using namespace std;
struct node {
  long long sum;
  long long val;
  long long color;
};
node T[400040];
int n, m;
void built(int node, int l, int r) {
  if (l == r) {
    T[node].color = l;
    T[node].sum = 0;
    T[node].val = 0;
    return;
  }
  int mid = (l + r) >> 1;
  built(node << 1, l, mid);
  built(node << 1 | 1, mid + 1, r);
}
void update(int node, int l, int r, int u, int v, int col) {
  if ((r < u) || (l > v)) return;
  if ((u <= l) && (r <= v) && (T[node].color)) {
    T[node].sum += abs(col - T[node].color) * (r - l + 1);
    T[node].val += abs(col - T[node].color);
    T[node].color = col;
    return;
  }
  int mid = (l + r) >> 1;
  if (T[node].val > 0) {
    T[node << 1].val += T[node].val;
    T[node << 1].sum += T[node].val * (mid - l + 1);
    T[node << 1 | 1].val += T[node].val;
    T[node << 1 | 1].sum += T[node].val * (r - mid);
    T[node].val = 0;
    T[node << 1].color = T[node].color;
    T[node << 1 | 1].color = T[node].color;
  }
  T[node].color = 0;
  update(node << 1, l, mid, u, v, col);
  update(node << 1 | 1, mid + 1, r, u, v, col);
  T[node].sum = T[node << 1].sum + T[node << 1 | 1].sum;
  if (T[node << 1].color == T[node << 1 | 1].color)
    T[node].color = T[node << 1].color;
}
long long query(int node, int l, int r, int u, int v) {
  long long res = 0;
  if ((v < l) || (r < u)) return 0;
  if ((u <= l) && (r <= v)) {
    return T[node].sum;
  }
  int mid = (l + r) >> 1;
  if (T[node].val > 0) {
    T[node << 1].val += T[node].val;
    T[node << 1].sum += T[node].val * (mid - l + 1);
    T[node << 1 | 1].val += T[node].val;
    T[node << 1 | 1].sum += T[node].val * (r - mid);
    T[node].val = 0;
    T[node << 1].color = T[node].color;
    T[node << 1 | 1].color = T[node].color;
  }
  res += query(node << 1, l, mid, u, v);
  res += query(node << 1 | 1, mid + 1, r, u, v);
  T[node].sum = T[node << 1].sum + T[node << 1 | 1].sum;
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  built(1, 1, n);
  int u, v, col, x;
  for (int i = 1; i <= m; i++) {
    cin >> x;
    if (x == 1) {
      cin >> u >> v >> col;
      update(1, 1, n, u, v, col);
    } else if (x == 2) {
      cin >> u >> v;
      cout << query(1, 1, n, u, v) << "\n";
    }
  }
  return 0;
}
