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 long long lnf = 0x3f3f3f3f3f3f3f3f;
const int maxn = 100100;
struct node {
  int l, r;
  long long sum;
  long long laz;
  long long color;
} t[maxn << 2];
void pushup(int cnt) {
  t[cnt].sum = t[cnt << 1].sum + t[cnt << 1 | 1].sum;
  t[cnt].color =
      t[cnt << 1].color == t[cnt << 1 | 1].color ? t[cnt << 1].color : 0;
}
void pushdown(int cnt) {
  if (t[cnt].laz) {
    t[cnt << 1].color = t[cnt << 1 | 1].color = t[cnt].color;
    t[cnt << 1].sum += (t[cnt << 1].r - t[cnt << 1].l + 1) * t[cnt].laz;
    t[cnt << 1 | 1].sum +=
        (t[cnt << 1 | 1].r - t[cnt << 1 | 1].l + 1) * t[cnt].laz;
    t[cnt << 1].laz += t[cnt].laz;
    t[cnt << 1 | 1].laz += t[cnt].laz;
    t[cnt].laz = 0;
  }
}
void build(int l, int r, int cnt) {
  t[cnt].l = l, t[cnt].r = r;
  t[cnt].laz = 0;
  t[cnt].sum = 0;
  if (l == r) {
    t[cnt].color = l;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, cnt << 1);
  build(mid + 1, r, cnt << 1 | 1);
  pushup(cnt);
}
void change(int l, int r, long long val, int cnt) {
  if (l <= t[cnt].l && t[cnt].r <= r && t[cnt].color) {
    t[cnt].sum += (t[cnt].r - t[cnt].l + 1) * abs(val - t[cnt].color);
    t[cnt].laz += abs(val - t[cnt].color);
    t[cnt].color = val;
    return;
  }
  if (t[cnt].l == t[cnt].r) {
    t[cnt].sum += abs(val - t[cnt].color);
    t[cnt].color = val;
    return;
  }
  pushdown(cnt);
  if (l <= t[cnt << 1].r) change(l, r, val, cnt << 1);
  if (r >= t[cnt << 1 | 1].l) change(l, r, val, cnt << 1 | 1);
  pushup(cnt);
}
long long ask(int l, int r, int cnt) {
  if (l <= t[cnt].l && t[cnt].r <= r) {
    return t[cnt].sum;
  }
  pushdown(cnt);
  long long ans = 0;
  if (l <= t[cnt << 1].r) ans += ask(l, r, cnt << 1);
  if (r >= t[cnt << 1 | 1].l) ans += ask(l, r, cnt << 1 | 1);
  return ans;
}
int main(void) {
  int n, m;
  scanf("%d%d", &n, &m);
  int pos, x, y;
  long long z;
  build(1, n, 1);
  for (int i = 1; i <= m; i++) {
    scanf("%d", &pos);
    if (pos == 1) {
      scanf("%d%d%lld", &x, &y, &z);
      change(x, y, z, 1);
    } else {
      scanf("%d%d", &x, &y);
      printf("%lld\n", ask(x, y, 1));
    }
  }
  return 0;
}
