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;
struct SEG {
  int l, r, same, col;
  long long add, sum;
} seg[100005 << 2];
void pushup(int cur) {
  seg[cur].sum =
      seg[cur << 1].sum +
      1LL * (seg[cur << 1].r - seg[cur << 1].l + 1) * seg[cur << 1].add +
      seg[cur << 1 | 1].sum +
      1LL * (seg[cur << 1 | 1].r - seg[cur << 1 | 1].l + 1) *
          seg[cur << 1 | 1].add;
  if (seg[cur << 1].same && seg[cur << 1 | 1].same &&
      seg[cur << 1].col == seg[cur << 1 | 1].col) {
    seg[cur].same = 1;
    seg[cur].col = seg[cur << 1].col;
  } else
    seg[cur].same = 0;
}
void pushdown(int cur) {
  if (seg[cur].same) {
    seg[cur << 1].same = seg[cur << 1 | 1].same = 1;
    seg[cur << 1].col = seg[cur << 1 | 1].col = seg[cur].col;
    seg[cur << 1].add += seg[cur].add;
    seg[cur << 1 | 1].add += seg[cur].add;
    seg[cur].add = 0;
  }
}
void build(int cur, int l, int r) {
  seg[cur].l = l;
  seg[cur].r = r;
  seg[cur].same = seg[cur].add = seg[cur].sum = seg[cur].col = 0;
  if (l == r) {
    seg[cur].col = l;
    seg[cur].same = 1;
    return;
  }
  int mid = (l + r) >> 1;
  build(cur << 1, l, mid);
  build(cur << 1 | 1, mid + 1, r);
}
void upd(int cur, int l, int r, int val) {
  if (l <= seg[cur].l && seg[cur].r <= r && seg[cur].same) {
    seg[cur].add += abs(seg[cur].col - val);
    seg[cur].col = val;
    return;
  }
  pushdown(cur);
  int mid = (seg[cur].l + seg[cur].r) >> 1;
  if (l <= mid) upd(cur << 1, l, r, val);
  if (r > mid) upd(cur << 1 | 1, l, r, val);
  pushup(cur);
}
long long query(int cur, int l, int r) {
  if (l <= seg[cur].l && seg[cur].r <= r)
    return seg[cur].sum + seg[cur].add * (seg[cur].r - seg[cur].l + 1);
  pushdown(cur);
  int mid = (seg[cur].l + seg[cur].r) >> 1;
  long long ret = 0;
  if (l <= mid) ret += query(cur << 1, l, r);
  if (r > mid) ret += query(cur << 1 | 1, l, r);
  pushup(cur);
  return ret;
}
int main() {
  int n, m, op, l, r, val;
  while (~scanf("%d%d", &n, &m)) {
    build(1, 1, n);
    while (m--) {
      scanf("%d", &op);
      if (op == 1) {
        scanf("%d%d%d", &l, &r, &val);
        upd(1, l, r, val);
      } else {
        scanf("%d%d", &l, &r);
        printf("%I64d\n", query(1, l, r));
      }
    }
  }
  return 0;
}
