#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
long long add[100030 << 2];
long long val[100030 << 2];
long long sum[100030 << 2];
long long m, n;
long long lab;
void PushDown(long long rt, long long cnt) {
  if (val[rt]) {
    val[rt << 1] = val[rt << 1 | 1] = val[rt];
    val[rt] = 0;
  }
  if (add[rt]) {
    add[rt << 1] += add[rt];
    add[rt << 1 | 1] += add[rt];
    sum[rt << 1] += add[rt] * (cnt - (cnt >> 1));
    sum[rt << 1 | 1] += add[rt] * (cnt >> 1);
    add[rt] = 0;
  }
}
void PushUp(long long rt) {
  sum[rt] = (sum[rt << 1] + sum[rt << 1 | 1]);
  val[rt] = (val[rt << 1] == val[rt << 1 | 1] ? val[rt << 1] : 0);
}
void Update(long long L, long long R, long long c, long long l, long long r,
            long long rt) {
  if (L <= l && R >= r) {
    if (val[rt]) {
      add[rt] += abs(c - val[rt]);
      sum[rt] += (long long)(r - l + 1) * abs(c - val[rt]);
      val[rt] = c;
      return;
    }
  }
  PushDown(rt, r - l + 1);
  long long m = (l + r) >> 1;
  if (L <= m) Update(L, R, c, l, m, rt << 1);
  if (R > m) Update(L, R, c, m + 1, r, rt << 1 | 1);
  PushUp(rt);
}
long long Query(long long L, long long R, long long l, long long r,
                long long rt) {
  if (L <= l && r <= R) return sum[rt];
  PushDown(rt, r - l + 1);
  long long m = (l + r) >> 1;
  long long ret = 0;
  if (L <= m) ret += Query(L, R, l, m, rt << 1);
  if (R > m) ret += Query(L, R, m + 1, r, rt << 1 | 1);
  return ret;
}
void BuildTree(long long l, long long r, long long rt) {
  add[rt] = 0;
  if (l == r) {
    val[rt] = l;
    sum[rt] = 0;
    return;
  }
  long long m = (l + r) >> 1;
  BuildTree(l, m, rt << 1);
  BuildTree(m + 1, r, rt << 1 | 1);
}
int main() {
  while (~scanf("%I64d%I64d", &n, &m)) {
    lab = 1;
    BuildTree(1, n, 1);
    long long op, l, r, x;
    for (long long i = 1; i <= m; i++) {
      scanf("%I64d", &op);
      if (op == 1) {
        scanf("%I64d%I64d%I64d", &l, &r, &x);
        Update(l, r, x, 1, n, 1);
      } else {
        scanf("%I64d%I64d", &l, &r);
        long long ans = Query(l, r, 1, n, 1);
        printf("%I64d\n", ans);
      }
    }
  }
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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.

### Response

```cpp
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
long long add[100030 << 2];
long long val[100030 << 2];
long long sum[100030 << 2];
long long m, n;
long long lab;
void PushDown(long long rt, long long cnt) {
  if (val[rt]) {
    val[rt << 1] = val[rt << 1 | 1] = val[rt];
    val[rt] = 0;
  }
  if (add[rt]) {
    add[rt << 1] += add[rt];
    add[rt << 1 | 1] += add[rt];
    sum[rt << 1] += add[rt] * (cnt - (cnt >> 1));
    sum[rt << 1 | 1] += add[rt] * (cnt >> 1);
    add[rt] = 0;
  }
}
void PushUp(long long rt) {
  sum[rt] = (sum[rt << 1] + sum[rt << 1 | 1]);
  val[rt] = (val[rt << 1] == val[rt << 1 | 1] ? val[rt << 1] : 0);
}
void Update(long long L, long long R, long long c, long long l, long long r,
            long long rt) {
  if (L <= l && R >= r) {
    if (val[rt]) {
      add[rt] += abs(c - val[rt]);
      sum[rt] += (long long)(r - l + 1) * abs(c - val[rt]);
      val[rt] = c;
      return;
    }
  }
  PushDown(rt, r - l + 1);
  long long m = (l + r) >> 1;
  if (L <= m) Update(L, R, c, l, m, rt << 1);
  if (R > m) Update(L, R, c, m + 1, r, rt << 1 | 1);
  PushUp(rt);
}
long long Query(long long L, long long R, long long l, long long r,
                long long rt) {
  if (L <= l && r <= R) return sum[rt];
  PushDown(rt, r - l + 1);
  long long m = (l + r) >> 1;
  long long ret = 0;
  if (L <= m) ret += Query(L, R, l, m, rt << 1);
  if (R > m) ret += Query(L, R, m + 1, r, rt << 1 | 1);
  return ret;
}
void BuildTree(long long l, long long r, long long rt) {
  add[rt] = 0;
  if (l == r) {
    val[rt] = l;
    sum[rt] = 0;
    return;
  }
  long long m = (l + r) >> 1;
  BuildTree(l, m, rt << 1);
  BuildTree(m + 1, r, rt << 1 | 1);
}
int main() {
  while (~scanf("%I64d%I64d", &n, &m)) {
    lab = 1;
    BuildTree(1, n, 1);
    long long op, l, r, x;
    for (long long i = 1; i <= m; i++) {
      scanf("%I64d", &op);
      if (op == 1) {
        scanf("%I64d%I64d%I64d", &l, &r, &x);
        Update(l, r, x, 1, n, 1);
      } else {
        scanf("%I64d%I64d", &l, &r);
        long long ans = Query(l, r, 1, n, 1);
        printf("%I64d\n", ans);
      }
    }
  }
  return 0;
}

```