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 range {
  int l, r, c;
  range(int l = 0, int r = 0, int c = 0) : l(l), r(r), c(c) {}
  bool operator<(const range &o) const { return l < o.l; }
};
int N, M;
long long t[400010], lz[400010];
set<range> rng;
void unlz(int nod, int l, int r) {
  if (lz[nod] == 0) return;
  t[nod] += (r - l + 1) * lz[nod];
  if (l != r) lz[nod * 2] += lz[nod], lz[nod * 2 + 1] += lz[nod];
  lz[nod] = 0;
}
void upd(int nod, int l, int r, int ql, int qr, int val) {
  unlz(nod, l, r);
  if (ql <= l && r <= qr) {
    lz[nod] += val;
    return;
  }
  int mid = (l + r) / 2;
  if (ql <= mid) upd(nod * 2, l, mid, ql, qr, val);
  if (mid < qr) upd(nod * 2 + 1, mid + 1, r, ql, qr, val);
  unlz(nod * 2, l, mid), unlz(nod * 2 + 1, mid + 1, r);
  t[nod] = t[nod * 2] + t[nod * 2 + 1];
}
long long query(int nod, int l, int r, int ql, int qr) {
  unlz(nod, l, r);
  if (ql <= l && r <= qr) return t[nod];
  int mid = (l + r) / 2;
  long long res = 0;
  if (ql <= mid) res += query(nod * 2, l, mid, ql, qr);
  if (mid < qr) res += query(nod * 2 + 1, mid + 1, r, ql, qr);
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> M;
  int i;
  for (i = 1; i <= N; i++) rng.insert(range(i, i, i));
  while (M--) {
    int tp, l, r, x;
    cin >> tp;
    if (tp == 1) {
      cin >> l >> r >> x;
      auto it = --rng.upper_bound(range(l));
      if ((*it).l < l) {
        range rg = *it;
        rng.erase(it);
        rng.insert(range(rg.l, l - 1, rg.c));
        it = rng.insert(range(l, rg.r, rg.c)).first;
      }
      range rg;
      int lr = -1;
      while (it != rng.end() && (*it).r <= r) {
        rg = *it;
        it = rng.erase(it);
        upd(1, 1, N, rg.l, rg.r, abs(rg.c - x));
        lr = rg.r;
      }
      if (it != rng.end() && (*it).l <= r) {
        rg = (*it);
        rng.erase(it);
        rng.insert(range(rg.l, r, x));
        rng.insert(range(r + 1, rg.r, rg.c));
        upd(1, 1, N, rg.l, r, abs(rg.c - x));
      }
      if (lr != -1) rng.insert(range(l, lr, x));
    } else {
      cin >> l >> r;
      cout << query(1, 1, N, l, r) << "\n";
    }
  }
  return 0;
}
