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;
void fre() {
  freopen("c://test//input.in", "r", stdin);
  freopen("c://test//output.out", "w", stdout);
}
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
  if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
  if (b < a) a = b;
}
const int N = 1 << 18, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int n, m;
long long flag[N];
long long sum[N];
long long len[N];
int same[N];
void build(int o, int l, int r) {
  flag[o] = 0;
  sum[o] = 0;
  len[o] = r - l + 1;
  same[o] = 0;
  if (l == r) {
    same[o] = l;
    return;
  }
  int mid = (l + r) >> 1;
  build(o << 1, l, mid);
  build(o << 1 | 1, mid + 1, r);
}
int op, L, R, V;
void pushdown(int o) {
  if (flag[o]) {
    flag[o << 1] += flag[o];
    flag[o << 1 | 1] += flag[o];
    sum[o << 1] += len[o << 1] * flag[o];
    sum[o << 1 | 1] += len[o << 1 | 1] * flag[o];
    flag[o] = 0;
  }
  if (same[o]) {
    same[o << 1] = same[o << 1 | 1] = same[o];
  }
}
void pushup(int o) {
  sum[o] = sum[o << 1] + sum[o << 1 | 1];
  same[o] = same[o << 1] == same[o << 1 | 1] ? same[o << 1] : 0;
}
void change(int o, int l, int r) {
  if (l >= L && r <= R) {
    if (same[o]) {
      flag[o] += abs(V - same[o]);
      sum[o] += len[o] * abs(V - same[o]);
      same[o] = V;
    } else {
      pushdown(o);
      int mid = (l + r) >> 1;
      change(o << 1, l, mid);
      change(o << 1 | 1, mid + 1, r);
      pushup(o);
    }
  } else {
    pushdown(o);
    int mid = (l + r) >> 1;
    if (L <= mid) change(o << 1, l, mid);
    if (R > mid) change(o << 1 | 1, mid + 1, r);
    pushup(o);
  }
}
long long check(int o, int l, int r) {
  if (l >= L && r <= R) {
    return sum[o];
  }
  pushdown(o);
  long long ret = 0;
  int mid = (l + r) >> 1;
  if (L <= mid) ret += check(o << 1, l, mid);
  if (R > mid) ret += check(o << 1 | 1, mid + 1, r);
  pushup(o);
  return ret;
}
int main() {
  while (~scanf("%d%d", &n, &m)) {
    build(1, 1, n);
    while (m--) {
      scanf("%d%d%d", &op, &L, &R);
      if (op == 1) {
        scanf("%d", &V);
        change(1, 1, n);
      } else {
        printf("%lld\n", check(1, 1, n));
      }
    }
  }
  return 0;
}
