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 = 1e5 + 100;
struct node {
  int l, r;
  long long f, c, col;
} T[MAXN << 2];
int n, m;
inline int mid(int x, int y) { return (x + y) >> 1; }
void push_up(int idx) {
  T[idx].f = T[idx << 1].f + T[idx << 1 | 1].f;
  if (T[idx << 1].c == T[idx << 1 | 1].c) {
    T[idx].c = T[idx << 1].c;
  }
}
void push_down(int idx) {
  if (T[idx].col) {
    T[idx << 1].col += T[idx].col;
    T[idx << 1 | 1].col += T[idx].col;
    T[idx << 1].f += T[idx].col * (T[idx << 1].r - T[idx << 1].l + 1);
    T[idx << 1 | 1].f +=
        T[idx].col * (T[idx << 1 | 1].r - T[idx << 1 | 1].l + 1);
    T[idx].col = 0;
  }
  if (T[idx].c != -1) {
    T[idx << 1].c = T[idx << 1 | 1].c = T[idx].c;
    T[idx].c = -1;
  }
}
void build(int idx, int l, int r) {
  T[idx].l = l;
  T[idx].r = r;
  T[idx].col = 0;
  T[idx].f = 0;
  T[idx].c = -1;
  if (l == r) {
    T[idx].c = l;
    return;
  }
  build(idx << 1, l, mid(l, r));
  build(idx << 1 | 1, mid(l, r) + 1, r);
}
void paint(int idx, int l, int r, long long x) {
  if (T[idx].l == l && T[idx].r == r && T[idx].c != -1) {
    T[idx].f += abs(T[idx].c - x) * (r - l + 1);
    T[idx].col += abs(T[idx].c - x);
    T[idx].c = x;
    return;
  }
  push_down(idx);
  if (r <= T[idx << 1].r)
    paint(idx << 1, l, r, x);
  else if (l >= T[idx << 1 | 1].l)
    paint(idx << 1 | 1, l, r, x);
  else {
    paint(idx << 1, l, T[idx << 1].r, x);
    paint(idx << 1 | 1, T[idx << 1 | 1].l, r, x);
  }
  push_up(idx);
}
long long query(int idx, int l, int r) {
  if (T[idx].l == l && T[idx].r == r) {
    return T[idx].f;
  }
  push_down(idx);
  if (r <= T[idx << 1].r)
    return query(idx << 1, l, r);
  else if (l >= T[idx << 1 | 1].l)
    return query(idx << 1 | 1, l, r);
  else
    return query(idx << 1, l, T[idx << 1].r) +
           query(idx << 1 | 1, T[idx << 1 | 1].l, r);
}
int main() {
  while (scanf("%d%d", &n, &m) != EOF) {
    int t;
    build(1, 1, n);
    for (int i = 0; i < m; i++) {
      scanf("%d", &t);
      if (t == 1) {
        int l, r;
        long long x;
        scanf("%d%d%I64d", &l, &r, &x);
        paint(1, l, r, x);
      } else if (t == 2) {
        int l, r;
        scanf("%d%d", &l, &r);
        long long ans = query(1, l, r);
        printf("%I64d\n", ans);
      }
    }
  }
  return 0;
}
