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;
bool operator<(pair<pair<long long, long long>, long long> a,
               pair<pair<long long, long long>, long long> b) {
  return a.first.first < b.first.first;
}
const long long max_n = 1e5 + 10;
set<pair<pair<long long, long long>, long long> > st;
long long n, q;
long long lazy[4 * max_n], seg[4 * max_n];
void shift(long long v, long long b, long long e, long long mid) {
  lazy[v << 1] += lazy[v];
  lazy[v << 1 ^ 1] += lazy[v];
  seg[v << 1] += (mid - b) * lazy[v];
  seg[v << 1 ^ 1] += (e - mid) * lazy[v];
  lazy[v] = 0;
}
void modify(long long v, long long b, long long e, long long l, long long r,
            long long x) {
  if (r <= b || e <= l) return;
  if (l <= b && e <= r) {
    lazy[v] += x;
    seg[v] += (e - b) * x;
    return;
  }
  long long mid = (b + e) / 2;
  shift(v, b, e, mid);
  modify(v << 1, b, mid, l, r, x);
  modify(v << 1 ^ 1, mid, e, l, r, x);
  seg[v] = seg[v << 1] + seg[v << 1 ^ 1];
}
long long get(long long v, long long b, long long e, long long l, long long r) {
  if (r <= b || e <= l) return 0;
  if (l <= b && e <= r) return seg[v];
  long long mid = (b + e) / 2;
  shift(v, b, e, mid);
  return get(v << 1, b, mid, l, r) + get(v << 1 ^ 1, mid, e, l, r);
}
void update(long long l, long long r, long long x) {
  set<pair<pair<long long, long long>, long long> >::iterator it =
      st.lower_bound({{l, r}, 1});
  if (it != st.begin()) it--;
  vector<pair<pair<long long, long long>, long long> > sec, gec;
  while (it != st.end()) {
    pair<pair<long long, long long>, long long> t = *it;
    if (t.first.second < l) {
      it++;
      continue;
    }
    if (t.first.first > r) break;
    if (t.first.first < l) sec.push_back({{t.first.first, l - 1}, t.second});
    if (t.first.second > r) sec.push_back({{r + 1, t.first.second}, t.second});
    modify(1, 0, n, max(l, t.first.first), min(r, t.first.second) + 1,
           abs(double(t.second - x)));
    gec.push_back(t);
    it++;
  }
  for (auto i : gec) st.erase(i);
  for (auto i : sec) st.insert(i);
  st.insert({{l, r}, x});
}
void init() {
  for (long long i = 0; i < n; i++) st.insert({{i, i}, i + 1});
}
int main() {
  scanf("%I64d%I64d", &n, &q);
  init();
  while (q--) {
    long long type, l, r;
    scanf("%I64d%I64d%I64d", &type, &l, &r);
    l--, r--;
    if (type == 1) {
      long long x;
      scanf("%I64d", &x);
      update(l, r, x);
    } else
      printf("%I64d\n", get(1, 0, n, l, r + 1));
  }
  return 0;
}
