#include <bits/stdc++.h>
using namespace std;
const int maxx = 1e5 + 100;
struct node {
  int l;
  int r;
  long long lazy;
  long long sum;
  long long cor;
} p[maxx << 2];
int n, m;
void pushup(int cur) {
  p[cur].cor = (p[cur << 1].cor == p[cur << 1 | 1].cor ? p[cur << 1].cor : 0);
  p[cur].sum = p[cur << 1].sum + p[cur << 1 | 1].sum;
}
void pushdown(int cur) {
  if (p[cur].lazy) {
    p[cur << 1].lazy += p[cur].lazy;
    p[cur << 1 | 1].lazy += p[cur].lazy;
    p[cur << 1 | 1].sum +=
        (p[cur].lazy * (p[cur << 1 | 1].r - p[cur << 1 | 1].l + 1));
    p[cur << 1].sum += (p[cur].lazy * (p[cur << 1].r - p[cur << 1].l + 1));
    p[cur << 1].cor = p[cur << 1 | 1].cor = p[cur].cor;
    p[cur].lazy = 0;
  }
}
void build(int l, int r, int cur) {
  p[cur].l = l;
  p[cur].r = r;
  p[cur].sum = p[cur].lazy = p[cur].cor = 0;
  if (l == r) {
    p[cur].cor = (long long)l;
    return;
  }
  int mid = (l + r) / 2;
  build(l, mid, cur << 1);
  build(mid + 1, r, cur << 1 | 1);
  pushup(cur);
}
void update(int l, int r, int cur, long long add) {
  int L = p[cur].l;
  int R = p[cur].r;
  if (l <= L && R <= r && p[cur].cor) {
    p[cur].sum += (abs(add - p[cur].cor) * (R - L + 1));
    p[cur].lazy += (abs(add - p[cur].cor));
    p[cur].cor = add;
    return;
  }
  pushdown(cur);
  int mid = (L + R) / 2;
  if (r <= mid)
    update(l, r, 2 * cur, add);
  else if (l > mid)
    update(l, r, 2 * cur + 1, add);
  else {
    update(l, mid, 2 * cur, add);
    update(mid + 1, r, 2 * cur + 1, add);
  }
  pushup(cur);
}
long long query(int l, int r, int cur) {
  int L = p[cur].l;
  int R = p[cur].r;
  if (l <= L && R <= r) {
    return p[cur].sum;
  }
  pushdown(cur);
  int mid = (L + R) / 2;
  if (r <= mid)
    return query(l, r, 2 * cur);
  else if (l > mid)
    return query(l, r, 2 * cur + 1);
  else
    return query(l, mid, 2 * cur) + query(mid + 1, r, 2 * cur + 1);
}
int main() {
  while (scanf("%d%d", &n, &m) != EOF) {
    build(1, n, 1);
    int x, y;
    long long z;
    int k;
    while (m--) {
      scanf("%d", &k);
      if (k == 1) {
        scanf("%d%d%lld", &x, &y, &z);
        update(x, y, 1, z);
      } else if (k == 2) {
        scanf("%d%d", &x, &y);
        printf("%lld\n", query(x, y, 1));
      }
    }
  }
  return 0;
}
