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;
int N, M;
long long ans, add[400009], sum[400009];
set<pair<int, pair<int, int> > > segm;
int mod(int x) {
  if (x < 0) return -x;
  return x;
}
void split(int nod, int l1, int l2) {
  if (add[nod] == 0) return;
  int f1 = nod << 1, f2 = (nod << 1) + 1;
  sum[f1] += 1LL * add[nod] * l1, sum[f2] += 1LL * add[nod] * l2;
  add[f1] += add[nod], add[f2] += add[nod];
  add[nod] = 0;
}
void U(int nod, int st, int dr, int x, int y, int val) {
  if (x <= st && dr <= y) {
    add[nod] += val;
    sum[nod] += 1LL * val * (dr - st + 1);
    return;
  }
  int mij = (st + dr) >> 1;
  split(nod, mij - st + 1, dr - mij);
  if (x <= mij) U(nod << 1, st, mij, x, y, val);
  if (y > mij) U((nod << 1) + 1, mij + 1, dr, x, y, val);
  sum[nod] = sum[nod << 1] + sum[(nod << 1) + 1];
}
void Q(int nod, int st, int dr, int x, int y) {
  if (x <= st && dr <= y) {
    ans += sum[nod];
    return;
  }
  int mij = (st + dr) >> 1;
  split(nod, mij - st + 1, dr - mij);
  if (x <= mij) Q(nod << 1, st, mij, x, y);
  if (y > mij) Q((nod << 1) + 1, mij + 1, dr, x, y);
}
void Update(int L, int R, int val) {
  set<pair<int, pair<int, int> > >::iterator it = segm.lower_bound(
                                                 make_pair(L, make_pair(0, 0))),
                                             it2;
  if (it->second.first < L) {
    int A = it->second.first, B = it->first, C = it->second.second;
    if (B > R) {
      U(1, 1, N, L, R, mod(val - C));
      segm.erase(it);
      segm.insert(make_pair(L - 1, make_pair(A, C)));
      segm.insert(make_pair(B, make_pair(R + 1, C)));
      segm.insert(make_pair(R, make_pair(L, val)));
      return;
    }
    U(1, 1, N, L, B, mod(val - C));
    segm.erase(it);
    segm.insert(make_pair(L - 1, make_pair(A, C)));
    it = segm.lower_bound(make_pair(L, make_pair(0, 0)));
  }
  while (1) {
    if (it == segm.end()) break;
    if (it->second.first > R) break;
    if (it->first > R) {
      int A = it->second.first, B = it->first, C = it->second.second;
      U(1, 1, N, A, R, mod(val - C));
      segm.erase(it);
      segm.insert(make_pair(B, make_pair(R + 1, C)));
      break;
    }
    it2 = it, it2++;
    U(1, 1, N, it->second.first, it->first, mod(val - it->second.second));
    segm.erase(it);
    it = it2;
  }
  segm.insert(make_pair(R, make_pair(L, val)));
}
int main() {
  scanf("%d %d", &N, &M);
  for (int i = 1; i <= N; i++) segm.insert(make_pair(i, make_pair(i, i)));
  while (M--) {
    int tip, a, b, c;
    scanf("%d", &tip);
    if (tip == 1) {
      scanf("%d %d %d", &a, &b, &c);
      Update(a, b, c);
    } else {
      scanf("%d %d", &a, &b), ans = 0LL;
      Q(1, 1, N, a, b);
      printf("%I64d\n", ans);
    }
  }
  return 0;
}
