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 = (1 << 18) + 5;
int N, M;
long long seg[MAXN];
long long lazy[MAXN];
int color[MAXN];
void build_tree(int node, int left, int right) {
  if (left > right) return;
  if (left == right) {
    color[node] = left;
    return;
  }
  build_tree(2 * node, left, (left + right) / 2);
  build_tree(2 * node + 1, (left + right) / 2 + 1, right);
}
void check_lazy(int node, int left, int right) {
  if (lazy[node] > 0) {
    if (left < right) {
      lazy[2 * node] += lazy[node];
      lazy[2 * node + 1] += lazy[node];
      seg[2 * node] += lazy[node] * ((left + right) / 2 - left + 1);
      seg[2 * node + 1] += lazy[node] * (right - (left + right) / 2);
      if (color[node] > 0) {
        color[2 * node] = color[node];
        color[2 * node + 1] = color[node];
      }
    }
    lazy[node] = 0;
  }
}
void update(int node, int left, int right, int ql, int qr, int x) {
  if (left > right || left > qr || right < ql) return;
  if (ql <= left && right <= qr && color[node] > 0) {
    seg[node] += (long long)abs(x - color[node]) * (right - left + 1);
    lazy[node] += abs(x - color[node]);
    color[node] = x;
    return;
  }
  check_lazy(node, left, right);
  update(2 * node, left, (left + right) / 2, ql, qr, x);
  update(2 * node + 1, (left + right) / 2 + 1, right, ql, qr, x);
  seg[node] = seg[2 * node] + seg[2 * node + 1];
  if (ql <= left && right <= qr)
    color[node] = x;
  else
    color[node] = 0;
}
long long query(int node, int left, int right, int ql, int qr) {
  if (left > right || left > qr || right < ql) return 0;
  if (ql <= left && right <= qr) return seg[node];
  check_lazy(node, left, right);
  return query(2 * node, left, (left + right) / 2, ql, qr) +
         query(2 * node + 1, (left + right) / 2 + 1, right, ql, qr);
}
int main() {
  cin >> N >> M;
  build_tree(1, 1, N);
  for (int i = 0; i < M; i++) {
    int type;
    cin >> type;
    if (type == 1) {
      int ql, qr, x;
      cin >> ql >> qr >> x;
      update(1, 1, N, ql, qr, x);
    } else {
      int ql, qr;
      cin >> ql >> qr;
      cout << query(1, 1, N, ql, qr) << "\n";
    }
  }
  return 0;
}
