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;
template <class T>
inline void umax(T &x, T y) {
  if (y > x) x = y;
}
template <class T>
inline void umin(T &x, T y) {
  if (y < x) x = y;
}
const long long N = 2e5 + 5, B = 0x7fffffff;
long long lz[4 * N], st[4 * N], cl[4 * N];
int n, m;
void build(int l, int r, int id) {
  if (l == r) {
    lz[id] = l;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, id << 1);
  build(mid + 1, r, id << 1 | 1);
}
void shift(int id, int l, int r) {
  if (lz[id] == 0 || l == r) return;
  int mid = (l + r) >> 1;
  st[id << 1] += cl[id] * (mid - l + 1);
  st[id << 1 | 1] += cl[id] * (r - (mid + 1) + 1);
  cl[id << 1] += cl[id];
  cl[id << 1 | 1] += cl[id];
  lz[id << 1] = lz[id << 1 | 1] = lz[id];
  lz[id] = cl[id] = 0;
}
void yapla(int l, int r, int id, long long x, int q1, int q2) {
  if (lz[id] != 0) {
    st[id] += abs(((r - l + 1) * x) - (lz[id] * (r - l + 1)));
    cl[id] += abs(lz[id] - x);
    lz[id] = 0;
    return;
  }
  if (l == r) {
    lz[id] = 0;
    return;
  }
  int mid = (l + r) >> 1;
  yapla(l, mid, id << 1, x, q1, q2);
  yapla(mid + 1, r, id << 1 | 1, x, q1, q2);
  st[id] = st[id << 1] + st[id << 1 | 1];
  lz[id] = 0;
}
void upd(int l, int r, int id, int ql, int qr, long long x) {
  if (r < ql || l > qr) return;
  if (l >= ql && r <= qr) {
    yapla(l, r, id, x, l, r);
    lz[id] = x;
    return;
  }
  shift(id, l, r);
  int mid = (l + r) >> 1;
  upd(l, mid, id << 1, ql, qr, x);
  upd(mid + 1, r, id << 1 | 1, ql, qr, x);
  st[id] = st[id << 1] + st[id << 1 | 1];
}
long long get(int l, int r, int id, int ql, int qr) {
  if (r < ql || l > qr) return 0;
  if (l >= ql && r <= qr) {
    return st[id];
  }
  shift(id, l, r);
  int mid = (l + r) >> 1;
  return get(l, mid, id << 1, ql, qr) + get(mid + 1, r, id << 1 | 1, ql, qr);
}
int main() {
  scanf("%d%d", &n, &m);
  build(1, n, 1);
  for (int i = 1; i <= m; i++) {
    int type, l, r, x;
    scanf("%d", &type);
    if (type == 1) {
      scanf("%d%d%d", &l, &r, &x);
      upd(1, n, 1, l, r, x);
    } else {
      scanf("%d%d", &l, &r);
      printf("%I64d\n", get(1, n, 1, l, r));
    }
  }
  return !1;
}
