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 = 100000 + 50;
struct SegNode {
  long long sum, delta, color;
  SegNode *left, *right;
};
SegNode nodePool[maxn << 2];
SegNode *cur = nodePool;
SegNode *root = nullptr;
void BuildTree(SegNode *&root, int nL, int nR) {
  root = cur++;
  root->left = root->right = nullptr;
  if (nL == nR) {
    root->color = nL;
    root->sum = root->delta = 0;
    return;
  }
  int Mid = (nL + nR) >> 1;
  BuildTree(root->left, nL, Mid);
  BuildTree(root->right, Mid + 1, nR);
}
long long Query(SegNode *root, const int &nL, const int &nR, const int &qL,
                const int &qR) {
  if (qL <= nL && nR <= qR) {
    return root->sum;
  }
  int Mid = (nL + nR) >> 1;
  if (qR <= Mid)
    return Query(root->left, nL, Mid, qL, qR) +
           1LL * root->delta * (qR - qL + 1);
  if (Mid < qL)
    return Query(root->right, Mid + 1, nR, qL, qR) +
           1LL * root->delta * (qR - qL + 1);
  return Query(root->left, nL, Mid, qL, Mid) +
         Query(root->right, Mid + 1, nR, Mid + 1, qR) +
         1LL * root->delta * (qR - qL + 1);
}
void Clear(SegNode *root, const int &nL, const int &nR, const int &newColor) {
  if (root->color > 0) {
    root->delta += abs(root->color - newColor);
    root->sum += 1LL * abs(root->color - newColor) * (nR - nL + 1);
  } else {
    int Mid = (nL + nR) >> 1;
    Clear(root->left, nL, Mid, newColor);
    Clear(root->right, Mid + 1, nR, newColor);
    root->sum =
        root->left->sum + root->right->sum + 1LL * root->delta * (nR - nL + 1);
  }
  root->color = -1;
}
void Modify(SegNode *root, const int &nL, const int &nR, const int &qL,
            const int &qR, const int &newColor) {
  if (qL <= nL && nR <= qR) {
    Clear(root, nL, nR, newColor);
    root->color = newColor;
  } else {
    if (root->color > 0)
      root->left->color = root->right->color = root->color, root->color = -1;
    int Mid = (nL + nR) >> 1;
    if (qL <= Mid) Modify(root->left, nL, Mid, qL, qR, newColor);
    if (Mid < qR) Modify(root->right, Mid + 1, nR, qL, qR, newColor);
    root->sum =
        root->left->sum + root->right->sum + 1LL * root->delta * (nR - nL + 1);
  }
}
int n, m;
int main() {
  scanf("%d%d", &n, &m);
  BuildTree(root, 1, n);
  while (m--) {
    int ope, L, R;
    scanf("%d%d%d", &ope, &L, &R);
    if (ope == 1) {
      int newColor;
      scanf("%d", &newColor);
      Modify(root, 1, n, L, R, newColor);
    } else {
      cout << Query(root, 1, n, L, R) << endl;
    }
  }
  return 0;
}
