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 N = 1e5 + 10;
struct node {
  long long l, r, w;
  node(long long L = 0, long long rr = 0, long long ww = 0) {
    l = L;
    r = rr;
    w = ww;
    return;
  }
};
multiset<node> s;
long long n, m;
bool operator<(node x, node y) { return x.r < y.r; }
struct TreeBinary {
  long long w[N << 2], lazy[N << 2];
  void Downdata(long long x, long long l, long long r) {
    if (!lazy[x]) return;
    long long mid = (l + r) >> 1;
    w[x * 2] += lazy[x] * (mid - l + 1);
    w[x * 2 + 1] += lazy[x] * (r - mid);
    lazy[x * 2] += lazy[x];
    lazy[x * 2 + 1] += lazy[x];
    lazy[x] = 0;
    return;
  }
  void Change(long long l, long long r, long long val, long long L = 1,
              long long R = n, long long x = 1) {
    if (L == l && R == r) {
      w[x] += val * (r - l + 1);
      lazy[x] += val;
      return;
    }
    long long mid = (L + R) >> 1;
    Downdata(x, L, R);
    if (r <= mid)
      Change(l, r, val, L, mid, x * 2);
    else if (l > mid)
      Change(l, r, val, mid + 1, R, x * 2 + 1);
    else
      Change(l, mid, val, L, mid, x * 2),
          Change(mid + 1, r, val, mid + 1, R, x * 2 + 1);
    w[x] = w[x * 2] + w[x * 2 + 1];
    return;
  }
  long long Ask(long long l, long long r, long long L = 1, long long R = n,
                long long x = 1) {
    if (L == l && R == r) return w[x];
    long long mid = (L + R) >> 1;
    Downdata(x, L, R);
    if (r <= mid) return Ask(l, r, L, mid, x * 2);
    if (l > mid) return Ask(l, r, mid + 1, R, x * 2 + 1);
    return Ask(l, mid, L, mid, x * 2) + Ask(mid + 1, r, mid + 1, R, x * 2 + 1);
  }
} T;
signed main() {
  multiset<node>::iterator it;
  scanf("%lld%lld", &n, &m);
  for (long long i = 1; i <= n; i++) s.insert(node(i, i, i));
  while (m--) {
    long long op, l, r, x;
    scanf("%lld%lld%lld", &op, &l, &r);
    if (op == 1) {
      scanf("%lld", &x);
      while (1) {
        it = s.lower_bound(node(l, l, l));
        node tmp = *it;
        s.erase(it);
        if (tmp.l < l && tmp.r > r) T.Change(l, r, abs(x - tmp.w));
        if (tmp.l < l) {
          s.insert(node(tmp.l, l - 1, tmp.w));
          if (tmp.r <= r) T.Change(l, tmp.r, abs(x - tmp.w));
        }
        if (tmp.r > r) {
          s.insert(node(r + 1, tmp.r, tmp.w));
          if (tmp.l >= l) T.Change(tmp.l, r, abs(x - tmp.w));
          break;
        }
        if (tmp.l >= l && tmp.r <= r) T.Change(tmp.l, tmp.r, abs(x - tmp.w));
        if (tmp.r == r) break;
      }
      s.insert(node(l, r, x));
    } else
      printf("%lld\n", T.Ask(l, r));
  }
  return 0;
}
