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;
vector<int64_t> mod;
vector<int64_t> t;
vector<int64_t> mod2;
void push(int64_t v, int64_t l, int64_t r) {
  t[v] += (r - l + 1) * mod[v];
  if (l != r) {
    mod[2 * v] += mod[v];
    mod[2 * v + 1] += mod[v];
    if (mod2[v] != -1) {
      mod2[2 * v] = mod2[v];
      mod2[2 * v + 1] = mod2[v];
    }
  }
  mod[v] = 0;
}
void update(int64_t v, int64_t tl, int64_t tr, int64_t l, int64_t r,
            int64_t c) {
  push(v, tl, tr);
  if (tl > tr || l > r) return;
  if (tl == l && tr == r && mod2[v] != -1) {
    mod[v] += abs(c - mod2[v]);
    mod2[v] = c;
  } else {
    int64_t tm = (tl + tr) / 2;
    push(v, tl, tr);
    update(2 * v, tl, tm, l, min(r, tm), c);
    update(2 * v + 1, tm + 1, tr, max(l, tm + 1), r, c);
    push(2 * v, tl, tm);
    push(2 * v + 1, tm + 1, tr);
    t[v] = t[2 * v] + t[2 * v + 1];
    if (mod2[2 * v] == mod2[2 * v + 1]) {
      mod2[v] = mod2[2 * v];
    } else
      mod2[v] = -1;
  }
}
int64_t get(int64_t v, int64_t tl, int64_t tr, int64_t l, int64_t r) {
  push(v, tl, tr);
  if (tl > tr || l > r) return 0;
  if (tl == l && tr == r)
    return t[v];
  else {
    int64_t tm = (tl + tr) / 2;
    return (get(2 * v, tl, tm, l, min(r, tm)) +
            get(2 * v + 1, tm + 1, tr, max(l, tm + 1), r));
  }
}
void build(int64_t v, int64_t tl, int64_t tr) {
  if (tl == tr)
    mod2[v] = tl + 1;
  else {
    int64_t tm = (tl + tr) / 2;
    build(2 * v, tl, tm);
    build(2 * v + 1, tm + 1, tr);
  }
}
int main() {
  int64_t n, q;
  cin >> n >> q;
  t.resize(4 * n);
  mod2.resize(4 * n, -1);
  mod.resize(4 * n);
  build(1, 0, n - 1);
  while (q--) {
    int64_t type;
    cin >> type;
    if (type == 1) {
      int64_t l, r, x;
      cin >> l >> r >> x;
      --l, --r;
      update(1, 0, n - 1, l, r, x);
    } else {
      int64_t l, r;
      cin >> l >> r;
      --l, --r;
      cout << get(1, 0, n - 1, l, r) << endl;
    }
  }
}
