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 N = 1e5 + 100;
struct node {
  int l;
  int r;
  long long co;
  long long sum;
  long long laz;
} tree[4 * N];
long long ac;
void pushup(int cur) {
  tree[cur].sum = tree[cur * 2].sum + tree[cur * 2 + 1].sum;
  if (tree[cur * 2].co == tree[cur * 2 + 1].co)
    tree[cur].co = tree[cur * 2].co;
  else
    tree[cur].co = 0;
}
void pushdown(int cur) {
  if (tree[cur].laz) {
    tree[cur * 2].sum +=
        ((long long)tree[cur].laz * (tree[cur * 2].r - tree[cur * 2].l + 1));
    tree[cur * 2].co = tree[cur].co;
    tree[cur * 2].laz += tree[cur].laz;
    tree[cur * 2 + 1].sum += ((long long)tree[cur].laz *
                              (tree[cur * 2 + 1].r - tree[cur * 2 + 1].l + 1));
    tree[cur * 2 + 1].co = tree[cur].co;
    tree[cur * 2 + 1].laz += tree[cur].laz;
    tree[cur].laz = 0;
  }
}
void build(int cur, int l, int r) {
  tree[cur].l = l;
  tree[cur].r = r;
  tree[cur].laz = 0;
  if (l == r) {
    tree[cur].co = l;
    tree[cur].sum = 0;
    return;
  }
  int mid = (l + r) / 2;
  build(cur * 2, l, mid);
  build(cur * 2 + 1, mid + 1, r);
  pushup(cur);
}
void updata(int cur, int x, int y, long long val) {
  if (x <= tree[cur].l && tree[cur].r <= y) {
    if (tree[cur].co) {
      ac = abs(tree[cur].co - val);
      tree[cur].sum += ((tree[cur].r - tree[cur].l + 1) * ac);
      tree[cur].laz += ac;
      tree[cur].co = val;
      return;
    }
  }
  pushdown(cur);
  if (x <= tree[cur * 2].r) updata(cur * 2, x, y, val);
  if (y >= tree[cur * 2 + 1].l) updata(cur * 2 + 1, x, y, val);
  pushup(cur);
}
long long query(int cur, int x, int y) {
  int l = tree[cur].l;
  int r = tree[cur].r;
  if (x <= l && r <= y) return tree[cur].sum;
  pushdown(cur);
  long long res = 0;
  if (x <= tree[cur * 2].r) res += query(cur * 2, x, y);
  if (y >= tree[cur * 2 + 1].l) res += query(cur * 2 + 1, x, y);
  return res;
}
int main() {
  int n, m;
  int op;
  int x, y;
  long long z;
  while (~scanf("%d%d", &n, &m)) {
    build(1, 1, n);
    while (m--) {
      scanf("%d", &op);
      if (op == 1) {
        scanf("%d%d%lld", &x, &y, &z);
        updata(1, x, y, z);
      } else {
        scanf("%d%d", &x, &y);
        printf("%lld\n", query(1, x, y));
      }
    }
  }
  return 0;
}
