#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
long long A[maxn];
int n, m;
struct segTree {
  struct segNode {
    long long col;
    long long sum;
  } tree[maxn * 4];
  void push_up(int x) {
    tree[x].sum = tree[x << 1].sum + tree[x << 1 | 1].sum;
    if (tree[x << 1].col == tree[x << 1 | 1].col)
      tree[x].col = tree[x << 1].col;
    else
      tree[x].col = 0;
  }
  void push_down(int x, int l, int r) {
    if (tree[x].col) {
      long long change = tree[x].sum - tree[x << 1].sum - tree[x << 1 | 1].sum;
      change /= (r - l + 1);
      int mid = (l + r) >> 1;
      tree[x << 1].sum += change * (mid - l + 1);
      tree[x << 1 | 1].sum += change * (r - mid);
      tree[x << 1].col = tree[x << 1 | 1].col = tree[x].col;
    }
    return;
  }
  void build(int x, int l, int r) {
    if (l == r) {
      tree[x].sum = 0;
      tree[x].col = A[l];
      return;
    }
    int mid = (l + r) >> 1;
    build(x << 1, l, mid);
    build(x << 1 | 1, mid + 1, r);
    push_up(x);
    return;
  }
  void update(int x, int l, int r, int ql, int qr, long long v) {
    if (l == r) {
      tree[x].sum += abs(tree[x].col - v);
      tree[x].col = v;
      return;
    }
    if (l == ql && r == qr && tree[x].col) {
      tree[x].sum += abs(tree[x].col - v) * 1LL * (r - l + 1);
      tree[x].col = v;
      return;
    }
    push_down(x, l, r);
    int mid = (l + r) >> 1;
    if (qr <= mid)
      update(x << 1, l, mid, ql, qr, v);
    else if (ql > mid)
      update(x << 1 | 1, mid + 1, r, ql, qr, v);
    else {
      update(x << 1, l, mid, ql, mid, v);
      update(x << 1 | 1, mid + 1, r, mid + 1, qr, v);
    }
    push_up(x);
    return;
  }
  long long query(int x, int l, int r, int ql, int qr) {
    if (l == ql && r == qr) return tree[x].sum;
    push_down(x, l, r);
    int mid = (l + r) >> 1;
    if (qr <= mid)
      return query(x << 1, l, mid, ql, qr);
    else if (ql > mid)
      return query(x << 1 | 1, mid + 1, r, ql, qr);
    else
      return query(x << 1, l, mid, ql, mid) +
             query(x << 1 | 1, mid + 1, r, mid + 1, qr);
  }
} T;
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; ++i) A[i] = i;
  T.build(1, 1, n);
  int opr, a, b;
  long long c;
  while (m--) {
    scanf("%d %d %d", &opr, &a, &b);
    if (opr == 1) {
      scanf("%lld", &c);
      T.update(1, 1, n, a, b, c);
    } else
      printf("%lld\n", T.query(1, 1, n, a, b));
  }
  return 0;
}
