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 long long maxn = 100100, mod = 1e9 + 7, maxs = 321, maxa = 1e6 + 100,
                maxb = 24;
const long long inf = 2e18 + 4;
long long max(long long x, long long y) { return (x > y ? x : y); }
long long min(long long x, long long y) { return (x < y ? x : y); }
long long seg[4 * maxn];
long long lazy[4 * maxn];
set<pair<pair<long long, long long>, long long> > st;
set<pair<pair<long long, long long>, long long> >::iterator it;
void shift(long long x, long long l, long long r) {
  long long mid = (l + r) / 2;
  lazy[2 * x] += lazy[x];
  seg[2 * x] += (mid - l) * lazy[x];
  lazy[2 * x + 1] += lazy[x];
  seg[2 * x + 1] += (r - mid) * lazy[x];
  lazy[x] = 0;
}
void update(long long x, long long l, long long r, long long s, long long t,
            long long val) {
  if (l >= s && r <= t) {
    lazy[x] += val;
    seg[x] += (r - l) * val;
    return;
  }
  shift(x, l, r);
  long long mid = (l + r) / 2;
  if (s < mid) {
    update(2 * x, l, mid, s, min(mid, t), val);
  }
  if (t > mid) {
    update(2 * x + 1, mid, r, max(s, mid), t, val);
  }
  seg[x] = seg[2 * x] + seg[2 * x + 1];
}
long long get(long long x, long long l, long long r, long long s, long long t) {
  if (l >= s && r <= t) {
    return seg[x];
  }
  shift(x, l, r);
  long long mid = (l + r) / 2;
  long long res = 0;
  if (s < mid) {
    res += get(2 * x, l, mid, s, min(mid, t));
  }
  if (t > mid) {
    res += get(2 * x + 1, mid, r, max(s, mid), t);
  }
  return res;
}
int32_t main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, q;
  cin >> n >> q;
  for (long long i = 0; i < n; i++) {
    st.insert(make_pair(make_pair(i, i + 1), i + 1));
  }
  while (q--) {
    long long t, l, r, x;
    cin >> t >> l >> r;
    l--;
    if (t == 1) {
      cin >> x;
      it = st.lower_bound(make_pair(make_pair(r, -inf), -inf));
      while (it != st.begin()) {
        it--;
        long long cl = it->first.first;
        long long cr = it->first.second;
        long long cx = it->second;
        long long val = abs(x - cx);
        if (cr <= l) {
          break;
        }
        st.erase(it);
        if (cr > r && cl >= l) {
          update(1, 0, maxn, cl, r, val);
          st.insert(make_pair(make_pair(r, cr), cx));
        } else if (cr <= r && cl < l) {
          update(1, 0, maxn, l, cr, val);
          st.insert(make_pair(make_pair(cl, l), cx));
        } else if (cr <= r && cl >= l) {
          update(1, 0, maxn, cl, cr, val);
        } else {
          update(1, 0, maxn, l, r, val);
          st.insert(make_pair(make_pair(cl, l), cx));
          st.insert(make_pair(make_pair(r, cr), cx));
        }
        it = st.lower_bound(make_pair(make_pair(r, -inf), -inf));
      }
      st.insert(make_pair(make_pair(l, r), x));
      continue;
    }
    cout << get(1, 0, maxn, l, r) << endl;
  }
  return 0;
}
