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 = 1 << 20;
int n, m;
struct sgt {
  long long tree[2 * N], lazy[2 * N];
  void build(int arr[], int cur = 1, int l = 1, int r = n) {
    if (l == r)
      tree[cur] = arr[l];
    else {
      build(arr, cur << 1, l, ((l + r) >> 1));
      build(arr, cur << 1 | 1, ((l + r) >> 1) + 1, r);
      tree[cur] = tree[cur << 1] + tree[cur << 1 | 1];
    }
  }
  void propagate(int& cur, int& l, int& r) {
    if (lazy[cur]) {
      tree[cur << 1] += lazy[cur] * (((l + r) >> 1) - l + 1);
      tree[cur << 1 | 1] += lazy[cur] * (r - ((l + r) >> 1));
      lazy[cur << 1] += lazy[cur];
      lazy[cur << 1 | 1] += lazy[cur];
      lazy[cur] = 0;
    }
  }
  void updtRange(int x, int y, long long val, int cur = 1, int l = 1,
                 int r = n) {
    propagate(cur, l, r);
    if (x > r || y < l) return;
    if (x <= l && r <= y) {
      tree[cur] += val * (r - l + 1);
      lazy[cur] += val;
    } else {
      updtRange(x, y, val, cur << 1, l, ((l + r) >> 1));
      updtRange(x, y, val, cur << 1 | 1, ((l + r) >> 1) + 1, r);
      tree[cur] = tree[cur << 1] + tree[cur << 1 | 1];
    }
  }
  void updtIndx(int indx, int val, int cur = 1, int l = 1, int r = n) {
    propagate(cur, l, r);
    if (indx < l || indx > r) return;
    if (l == r && indx == l)
      tree[cur] += val;
    else {
      updtIndx(indx, val, cur << 1, l, ((l + r) >> 1));
      updtIndx(indx, val, cur << 1 | 1, ((l + r) >> 1) + 1, r);
      tree[cur] = tree[cur << 1] + tree[cur << 1 | 1];
    }
  }
  long long getsum(int x, int y, int cur = 1, int l = 1, int r = n) {
    propagate(cur, l, r);
    if (x > r || y < l) return 0;
    if (x <= l && r <= y) return tree[cur];
    return getsum(x, y, cur << 1, l, ((l + r) >> 1)) +
           getsum(x, y, cur << 1 | 1, ((l + r) >> 1) + 1, r);
  }
};
sgt sg;
set<pair<pair<int, int>, int> > arr;
void makeit(int& st, int& e, int& val) {
  pair<pair<int, int>, int> cur;
  int ns = st;
  while (ns <= e) {
    cur = *(arr.lower_bound({{ns, 0}, 0}));
    arr.erase(cur);
    if (cur.first.second <= ns - 1) {
      arr.insert({{ns - 1, cur.first.second}, cur.second});
    }
    if (cur.first.first > e) {
      arr.insert({{cur.first.first, e + 1}, cur.second});
      sg.updtRange(ns, e, abs(val - cur.second));
      break;
    }
    sg.updtRange(ns, cur.first.first, abs(val - cur.second));
    ns = cur.first.first + 1;
  }
  arr.insert({{e, st}, val});
}
int t, lft, rit, val;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) arr.insert({{i, i}, i});
  while (m--) {
    scanf("%d %d %d", &t, &lft, &rit);
    if (t & 1) {
      scanf("%d", &val);
      makeit(lft, rit, val);
    } else {
      printf("%lld\n", sg.getsum(lft, rit));
    }
  }
  return 0;
}
