#include <bits/stdc++.h>
using namespace std;
inline int Mid(int a, int b) { return (a + b) >> 1; }
inline long long ABS(long long x) { return x > 0 ? x : -x; }
int n, m;
struct node {
  int l, r, id;
  long long siz() { return (long long)(r - l + 1); }
  long long sum, col, lazy, same;
} tree[100005 << 2];
void push_down(int id) {
  if (tree[id].l == tree[id].r) return;
  if (tree[id].lazy) {
    tree[(id << 1)].sum += tree[(id << 1)].siz() * tree[id].lazy;
    tree[(id << 1 | 1)].sum += tree[(id << 1 | 1)].siz() * tree[id].lazy;
    tree[(id << 1)].lazy += tree[id].lazy;
    tree[(id << 1 | 1)].lazy += tree[id].lazy;
    tree[id].lazy = 0;
  }
  if (tree[id].col >= 0) {
    tree[(id << 1)].col = tree[(id << 1 | 1)].col = tree[id].col;
  }
}
void push_up(int id) {
  if (tree[(id << 1)].col == tree[(id << 1 | 1)].col &&
      tree[(id << 1)].col >= 0)
    tree[id].col = tree[(id << 1)].col, tree[id].same = 1;
  else
    tree[id].col = -1, tree[id].same = 0;
  tree[id].sum = tree[(id << 1)].sum + tree[(id << 1 | 1)].sum;
}
void build(int l, int r, int id) {
  tree[id].l = l, tree[id].r = r;
  tree[id].sum = 0;
  tree[id].lazy = 0;
  tree[id].col = -1;
  tree[id].same = 0;
  if (l == r) {
    tree[id].col = l;
    tree[id].same = 1;
    return;
  }
  int mid = Mid(l, r);
  build(l, mid, (id << 1));
  build(mid + 1, r, (id << 1 | 1));
}
void updata(int l, int r, int id, long long col) {
  push_down(id);
  if (l == tree[id].l && tree[id].r == r && tree[id].same) {
    tree[id].sum += tree[id].siz() * ABS(col - tree[id].col);
    tree[id].lazy += ABS(col - tree[id].col);
    tree[id].col = col;
    return;
  }
  int mid = Mid(tree[id].l, tree[id].r);
  if (mid < l)
    updata(l, r, (id << 1 | 1), col);
  else if (r <= mid)
    updata(l, r, (id << 1), col);
  else {
    updata(l, mid, (id << 1), col);
    updata(mid + 1, r, (id << 1 | 1), col);
  }
  push_up(id);
}
long long query(int l, int r, int id) {
  push_down(id);
  if (l == tree[id].l && tree[id].r == r) return tree[id].sum;
  int mid = Mid(tree[id].l, tree[id].r);
  if (mid < l)
    return query(l, r, (id << 1 | 1));
  else if (r <= mid)
    return query(l, r, (id << 1));
  else
    return query(l, mid, (id << 1)) + query(mid + 1, r, (id << 1 | 1));
}
int main() {
  int type, l, r;
  long long x;
  while (~scanf("%d %d", &n, &m)) {
    build(1, n, 1);
    while (m--) {
      scanf("%d %d %d", &type, &l, &r);
      if (type == 1) {
        scanf("%I64d", &x);
        updata(l, r, 1, x);
      } else {
        printf("%I64d\n", query(l, r, 1));
      }
    }
  }
  return 0;
}
