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>
long long fabs(long long x) {
  if (x < 0) return -x;
  return x;
}
class SegTree {
 private:
  struct segtree {
    int l, r;
    long long v, happiness, mark;
  } seg[100005 << 2];

 public:
  void pushup(int rt) {
    seg[rt].happiness = seg[rt << 1].happiness + seg[rt << 1 | 1].happiness;
    if (seg[rt << 1].v == seg[rt << 1 | 1].v) {
      seg[rt].v = seg[rt << 1].v;
    } else
      seg[rt].v = 0;
  }
  void pushdown(int rt) {
    if (seg[rt].mark) {
      int mid = (seg[rt].r + seg[rt].l) >> 1;
      seg[rt << 1].happiness += seg[rt].mark * (mid - seg[rt].l + 1);
      seg[rt << 1 | 1].happiness += seg[rt].mark * (seg[rt].r - mid);
      seg[rt << 1].mark += seg[rt].mark;
      seg[rt << 1 | 1].mark += seg[rt].mark;
      seg[rt << 1].v = seg[rt << 1 | 1].v = seg[rt].v;
      seg[rt].mark = 0;
      seg[rt].v = 0;
    }
  }
  void build(int l, int r, int rt) {
    seg[rt].happiness = 0;
    seg[rt].mark = 0;
    seg[rt].v = 0;
    seg[rt].l = l;
    seg[rt].r = r;
    if (l == r) {
      seg[rt].v = l;
      return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    pushup(rt);
  }
  void update(int L, int R, int rt, int v) {
    if (seg[rt].l >= L && seg[rt].r <= R) {
      if (seg[rt].v) {
        seg[rt].happiness += fabs(v - seg[rt].v) * (seg[rt].r - seg[rt].l + 1);
        seg[rt].mark += fabs(v - seg[rt].v);
        seg[rt].v = v;
        return;
      }
    }
    pushdown(rt);
    int mid = (seg[rt].l + seg[rt].r) >> 1;
    if (L <= mid) update(L, R, rt << 1, v);
    if (R > mid) update(L, R, rt << 1 | 1, v);
    pushup(rt);
  }
  long long query(int L, int R, int rt) {
    if (seg[rt].l >= L && seg[rt].r <= R) {
      return seg[rt].happiness;
    }
    pushdown(rt);
    long long a1 = 0, a2 = 0;
    int mid = (seg[rt].l + seg[rt].r) >> 1;
    if (L <= mid) a1 = query(L, R, rt << 1);
    if (R > mid) a2 = query(L, R, rt << 1 | 1);
    pushup(rt);
    return a1 + a2;
  }
} T;
int main() {
  int n, m, type, l, r, v;
  while (~scanf("%d%d", &n, &m)) {
    T.build(1, n, 1);
    while (m--) {
      scanf("%d", &type);
      if (type == 1) {
        scanf("%d%d%d", &l, &r, &v);
        T.update(l, r, 1, v);
      } else {
        scanf("%d%d", &l, &r);
        printf("%I64d\n", T.query(l, r, 1));
      }
    }
  }
}
