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;
struct line {
  int l, r;
  int col;
  long long int lazy;
  long long int sum;
} tre[100005 * 4];
void Build(int l, int r, int root) {
  tre[root].l = l;
  tre[root].r = r;
  if (l == r) {
    tre[root].lazy = 0;
    tre[root].sum = 0;
    tre[root].col = l;
    return;
  }
  tre[root].lazy = 0;
  int mid = (l + r) / 2;
  Build(l, mid, root * 2);
  Build(mid + 1, r, root * 2 + 1);
  tre[root].sum = tre[root * 2].sum + tre[root * 2 + 1].sum;
}
void Update(int l, int r, int col, int root) {
  if (tre[root].l > r || tre[root].r < l) return;
  if (tre[root].l >= l && tre[root].r <= r) {
    if (tre[root].col) {
      tre[root].sum += (long long)abs(tre[root].col - col) *
                       (long long)(tre[root].r - tre[root].l + 1);
      tre[root].lazy += abs(tre[root].col - col);
      tre[root].col = col;
    } else {
      Update(l, r, col, root * 2);
      Update(l, r, col, root * 2 + 1);
      tre[root].col = col;
      tre[root].sum = tre[root * 2].sum + tre[root * 2 + 1].sum;
    }
  } else {
    if (tre[root].col) {
      tre[root * 2].col = tre[root].col;
      tre[root * 2].sum +=
          tre[root].lazy * (tre[root * 2].r - tre[root * 2].l + 1);
      tre[root * 2].lazy += tre[root].lazy;
      tre[root * 2 + 1].col = tre[root].col;
      tre[root * 2 + 1].sum +=
          tre[root].lazy * (tre[root * 2 + 1].r - tre[root * 2 + 1].l + 1);
      tre[root * 2 + 1].lazy += tre[root].lazy;
      tre[root].col = 0;
      tre[root].lazy = 0;
    }
    Update(l, r, col, root * 2);
    Update(l, r, col, root * 2 + 1);
    tre[root].sum = tre[root * 2].sum + tre[root * 2 + 1].sum;
  }
  return;
}
long long int Sum(int l, int r, int root) {
  long long int sum = 0;
  if (tre[root].l > r || tre[root].r < l) return 0;
  if (tre[root].l >= l && tre[root].r <= r)
    sum += tre[root].sum;
  else {
    if (tre[root].col) {
      tre[root * 2].col = tre[root].col;
      tre[root * 2].sum +=
          tre[root].lazy * (tre[root * 2].r - tre[root * 2].l + 1);
      tre[root * 2].lazy += tre[root].lazy;
      tre[root * 2 + 1].col = tre[root].col;
      tre[root * 2 + 1].sum +=
          tre[root].lazy * (tre[root * 2 + 1].r - tre[root * 2 + 1].l + 1);
      tre[root * 2 + 1].lazy += tre[root].lazy;
      tre[root].col = 0;
      tre[root].lazy = 0;
    }
    sum += Sum(l, r, root * 2);
    sum += Sum(l, r, root * 2 + 1);
  }
  return sum;
}
int main() {
  int n, m;
  while (scanf("%d%d", &n, &m) != EOF) {
    memset(tre, 0, sizeof(tre));
    Build(1, n, 1);
    for (int i = 0; i < m; i++) {
      int u;
      scanf("%d", &u);
      if (u == 1) {
        int a, b, x;
        scanf("%d%d%d", &a, &b, &x);
        Update(a, b, x, 1);
      } else {
        int a, b;
        scanf("%d%d", &a, &b);
        long long int sum = Sum(a, b, 1);
        printf("%I64d\n", sum);
      }
    }
  }
}
