#include <bits/stdc++.h>
using namespace std;
int n, m;
int a, b, c, d;
struct Tree {
  int l, r, c;
  long long sum, add;
} tree[100005 << 2];
void build(int l, int r, int rt) {
  tree[rt].l = l;
  tree[rt].r = r;
  tree[rt].c = 0;
  tree[rt].sum = 0;
  tree[rt].add = 0;
  if (l == r) {
    tree[rt].c = l;
    return;
  }
  int mid = ((l + r) >> 1);
  build(l, mid, (rt << 1));
  build(mid + 1, r, (rt << 1 | 1));
}
void push_down(int rt) {
  if (tree[rt].c != 0) {
    tree[(rt << 1)].c = tree[(rt << 1 | 1)].c = tree[rt].c;
    tree[rt].c = 0;
  }
  if (tree[rt].add != 0) {
    tree[(rt << 1)].add += tree[rt].add;
    tree[(rt << 1 | 1)].add += tree[rt].add;
    tree[(rt << 1)].sum +=
        (long long)tree[rt].add *
        (long long)(tree[(rt << 1)].r - tree[(rt << 1)].l + 1);
    tree[(rt << 1 | 1)].sum +=
        (long long)tree[rt].add *
        (long long)(tree[(rt << 1 | 1)].r - tree[(rt << 1 | 1)].l + 1);
    tree[rt].add = 0;
  }
}
void push_up(int rt) {
  tree[rt].sum = tree[(rt << 1)].sum + tree[(rt << 1 | 1)].sum;
  if (tree[(rt << 1)].c == tree[(rt << 1 | 1)].c) {
    tree[rt].c = tree[(rt << 1)].c;
    tree[(rt << 1)].c = tree[(rt << 1 | 1)].c = 0;
  } else
    tree[rt].c = 0;
}
void update(int x, int y, int v, int rt) {
  int l = tree[rt].l;
  int r = tree[rt].r;
  if (l >= x && r <= y) {
    if (tree[rt].c != 0) {
      tree[rt].add += abs(v - tree[rt].c);
      tree[rt].sum += (long long)(r - l + 1) * (long long)abs(v - tree[rt].c);
      tree[rt].c = v;
      return;
    }
  }
  push_down(rt);
  int mid = ((l + r) >> 1);
  if (y <= mid)
    update(x, y, v, (rt << 1));
  else if (x >= mid + 1)
    update(x, y, v, (rt << 1 | 1));
  else {
    update(x, mid, v, (rt << 1));
    update(mid + 1, y, v, (rt << 1 | 1));
  }
  push_up(rt);
}
long long query(int x, int y, int rt) {
  int l = tree[rt].l;
  int r = tree[rt].r;
  if (x <= l && y >= r) {
    return tree[rt].sum;
  }
  push_down(rt);
  long long ret = 0;
  int mid = ((l + r) >> 1);
  if (y <= mid)
    ret = query(x, y, (rt << 1));
  else if (x >= mid + 1)
    ret = query(x, y, (rt << 1 | 1));
  else {
    ret += query(x, mid, (rt << 1));
    ret += query(mid + 1, y, (rt << 1 | 1));
  }
  return ret;
}
int main() {
  scanf("%d%d", &n, &m);
  build(1, n, 1);
  while (m--) {
    scanf("%d", &a);
    if (a == 1) {
      scanf("%d%d%d", &b, &c, &d);
      update(b, c, d, 1);
    } else {
      scanf("%d%d", &b, &c);
      printf("%lld\n", query(b, c, 1));
    }
  }
  return 0;
}
