DZY loves colors, and he enjoys painting.

On a colorful day, DZY gets a colorful ribbon, which consists of n units (they are numbered from 1 to n from left to right). The color of the i-th unit of the ribbon is i at first. It is colorful enough, but we still consider that the colorfulness of each unit is 0 at first.

DZY loves painting, we know. He takes up a paintbrush with color x and uses it to draw a line on the ribbon. In such a case some contiguous units are painted. Imagine that the color of unit i currently is y. When it is painted by this paintbrush, the color of the unit becomes x, and the colorfulness of the unit increases by |x - y|.

DZY wants to perform m operations, each operation can be one of the following:

  1. Paint all the units with numbers between l and r (both inclusive) with color x. 
  2. Ask the sum of colorfulness of the units between l and r (both inclusive). 



Can you help DZY?

Input

The first line contains two space-separated integers n, m (1 ≤ n, m ≤ 105).

Each of the next m lines begins with a integer type (1 ≤ type ≤ 2), which represents the type of this operation.

If type = 1, there will be 3 more integers l, r, x (1 ≤ l ≤ r ≤ n; 1 ≤ x ≤ 108) in this line, describing an operation 1.

If type = 2, there will be 2 more integers l, r (1 ≤ l ≤ r ≤ n) in this line, describing an operation 2.

Output

For each operation 2, print a line containing the answer — sum of colorfulness.

Examples

Input

3 3
1 1 2 4
1 2 3 5
2 1 3


Output

8


Input

3 4
1 1 3 4
2 1 1
2 2 2
2 3 3


Output

3
2
1


Input

10 6
1 1 5 3
1 2 7 9
1 10 10 11
1 3 8 12
1 1 10 3
2 1 10


Output

129

Note

In the first sample, the color of each unit is initially [1, 2, 3], and the colorfulness is [0, 0, 0].

After the first operation, colors become [4, 4, 3], colorfulness become [3, 2, 0].

After the second operation, colors become [4, 5, 5], colorfulness become [3, 3, 2].

So the answer to the only operation of type 2 is 8.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 9;
const int MOD = 10007;
int mod = 999998639;
long long fact(long long x, long long y) {
  long long ans = 1;
  for (int i = 0; i < y; i++) ans *= x;
  return ans;
}
inline long long qpow(long long b, long long e, long long m = MOD) {
  long long a = 1;
  for (; e; e >>= 1, b = b * b % m)
    if (e & 1) a = a * b % m;
  return a;
}
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  long long d = exgcd(b, a % b, x, y);
  long long z = x;
  x = y, y = z - y * (a / b);
  return d;
}
const int MAX = 1e5 + 10;
long long sum[MAX << 2], ans[MAX << 2], col[MAX << 2];
void push_down(int o, int len) {
  if (col[o]) {
    sum[o << 1] += sum[o];
    sum[o << 1 | 1] += sum[o];
    ans[o << 1] += sum[o] * (len - (len >> 1));
    ans[o << 1 | 1] += sum[o] * (len >> 1);
    col[o << 1] = col[o];
    col[o << 1 | 1] = col[o];
    col[o] = sum[o] = 0;
  }
}
void push_up(int o) {
  if (col[o << 1] == col[o << 1 | 1]) col[o] = col[o << 1];
  ans[o] = ans[o << 1] + ans[o << 1 | 1];
}
void build(int L, int R, int o) {
  ans[o] = 0;
  if (L == R) {
    col[o] = L;
    return;
  }
  int mid = (R + L) >> 1;
  build(L, mid, o << 1);
  build(mid + 1, R, o << 1 | 1);
}
void modify(int L, int R, int o, int ls, int rs, int val) {
  if (ls <= L && rs >= R && col[o]) {
    sum[o] += abs(col[o] - val);
    ans[o] += abs(col[o] - val) * (R - L + 1);
    col[o] = val;
    return;
  }
  push_down(o, R - L + 1);
  int mid = (R + L) >> 1;
  if (ls <= mid) modify(L, mid, o << 1, ls, rs, val);
  if (rs > mid) modify(mid + 1, R, o << 1 | 1, ls, rs, val);
  push_up(o);
}
long long Query(int L, int R, int o, int ls, int rs) {
  if (ls <= L && rs >= R) {
    return ans[o];
  }
  push_down(o, R - L + 1);
  int mid = (L + R) >> 1;
  long long res = 0;
  if (ls <= mid) res += Query(L, mid, o << 1, ls, rs);
  if (rs > mid) res += Query(mid + 1, R, o << 1 | 1, ls, rs);
  return res;
}
int main() {
  int n, m;
  int t, l, r, x;
  while (scanf("%d %d", &n, &m) == 2) {
    build(1, n, 1);
    for (int i = 1; i <= m; i++) {
      scanf("%d", &t);
      if (t == 1) {
        scanf("%d %d %d", &l, &r, &x);
        modify(1, n, 1, l, r, x);
      } else {
        scanf("%d %d", &l, &r);
        printf("%I64d\n", Query(1, n, 1, l, r));
      }
    }
  }
  return 0;
}
