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 SZ = 333;
const int MAXN = 100005;
int n;
struct sqrtDecomposition {
  int l, r;
  int C[SZ];
  long long int SC[SZ];
  long long int score;
  bool covered;
  int val;
  long long int extra;
  void init(int _l, int _r) {
    l = _l;
    r = _r;
    for (int i = 0; i < SZ; i++) {
      C[i] = i + l + 1;
      SC[i] = 0;
    }
    score = 0;
    covered = false;
    val = 0;
    extra = 0;
  }
  void fullUpdate(int x) {
    if (covered) {
      score += (long long int)abs(x - val) * SZ;
      extra += abs(x - val);
      val = x;
    } else {
      for (int i = 0; i < SZ; i++) {
        score += abs(x - C[i]);
        SC[i] += abs(x - C[i]);
        C[i] = x;
      }
      covered = true;
      extra = 0;
      val = x;
    }
  }
  void semiUpdate(int b, int e, int v) {
    if (covered) {
      for (int i = 0; i < SZ; i++) {
        if (b > l + i || e < l + i) {
          C[i] = val;
          SC[i] += extra;
        } else {
          C[i] = v;
          SC[i] += extra;
          SC[i] += abs(val - v);
          score += abs(val - v);
        }
      }
    } else {
      for (int i = b; i < e + 1; i++) {
        SC[i - l] += abs(C[i - l] - v);
        score += abs(C[i - l] - v);
        C[i - l] = v;
      }
    }
    covered = false;
    extra = 0;
  }
  long long int fullQuery() { return score; }
  long long int semiQuery(int b, int e) {
    long long int res = 0;
    if (covered) {
      for (int i = b; i < e + 1; i++) res += SC[i - l] + extra;
    } else {
      for (int i = b; i < e + 1; i++) res += SC[i - l];
    }
    return res;
  }
};
int blocks = 0;
sqrtDecomposition B[MAXN / SZ + 5];
void UUU(int l, int r, int x) {
  for (int i = 0; i < blocks; i++) {
    if (l > B[i].r || r < B[i].l) continue;
    if (l <= B[i].l && r >= B[i].r) {
      B[i].fullUpdate(x);
    } else {
      B[i].semiUpdate(max(B[i].l, l), min(B[i].r, r), x);
    }
  }
}
long long int QQQ(int l, int r) {
  long long int res = 0;
  long long int res1 = 0;
  for (int i = 0; i < blocks; i++) {
    if (l > B[i].r || r < B[i].l) continue;
    if (l <= B[i].l && r >= B[i].r) {
      res += B[i].fullQuery();
    } else {
      res += B[i].semiQuery(max(B[i].l, l), min(B[i].r, r));
    }
  }
  return res;
}
int main() {
  int m;
  scanf("%d%d", &n, &m);
  blocks = n / SZ;
  if (n % SZ) blocks++;
  for (int i = 0; i < blocks; i++) B[i].init(i * SZ, (i + 1) * SZ - 1);
  while (m--) {
    int type, l, r;
    scanf("%d%d%d", &type, &l, &r);
    l--;
    r--;
    if (type == 1) {
      int x;
      scanf("%d", &x);
      UUU(l, r, x);
    } else {
      cout << QQQ(l, r) << endl;
    }
  }
  return 0;
}
