#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>using namespace std;typedef long long LL;inline int Abs(int x) {return x < 0 ? -x : x;}const int MaxN = 100000 + 5;int n, m;
int Col[MaxN * 4], Len[MaxN * 4], Pc[MaxN * 4];LL T[MaxN * 4], D[MaxN * 4];bool Same[MaxN * 4];inline void Update(int x)
{Same[x] = Same[x << 1] && Same[x << 1 | 1] && Col[x << 1] == Col[x << 1 | 1];if (Same[x]) Col[x] = Col[x << 1]; T[x] = T[x << 1] + T[x << 1 | 1];Len[x] = Len[x << 1] + Len[x << 1 | 1];
}inline void Add(int x, LL Num)
{D[x] += Num;T[x] += (LL)Len[x] * Num;
}inline void PushDown(int x)
{if (D[x] != 0){Add(x << 1, D[x]);Add(x << 1 | 1, D[x]);D[x] = 0;}if (Pc[x] != 0){Col[x << 1] = Pc[x << 1] = Pc[x];Col[x << 1 | 1] = Pc[x << 1 | 1] = Pc[x];Pc[x] = 0;}
}void Build(int x, int s, int t)
{   if (s == t){Same[x] = true;Col[x] = s;T[x] = D[x] = Pc[x] = 0;Len[x] = 1;return;}int m = (s + t) >> 1;Build(x << 1, s, m);Build(x << 1 | 1, m + 1, t);Update(x);
}void Change(int x, int s, int t, int l, int r, int Num)
{if (l <= s && r >= t && Same[x]){int Temp = Abs(Col[x] - Num);D[x] += (LL)Temp;T[x] += (LL)Temp * (LL)Len[x];Col[x] = Pc[x] = Num;      return;}PushDown(x);int m = (s + t) >> 1;if (l <= m) Change(x << 1, s, m, l, r, Num);if (r >= m + 1) Change(x << 1 | 1, m + 1, t, l, r, Num);Update(x);
}LL Query(int x, int s, int t, int l, int r)
{if (l <= s && r >= t) return T[x];PushDown(x);int m = (s + t) >> 1;LL ret = 0;if (l <= m) ret += Query(x << 1, s, m, l, r);if (r >= m + 1) ret += Query(x << 1 | 1, m + 1, t, l, r);return ret;
}int main()
{scanf("%d%d", &n, &m);   Build(1, 1, n); int f, l, r, Num;for (int i = 1; i <= m; ++i){scanf("%d%d%d", &f, &l, &r);if (f == 1) {scanf("%d", &Num);Change(1, 1, n, l, r, Num);}else printf("%I64d\n", Query(1, 1, n, l, r));}return 0;
}