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;
int read() {
  char ch = getchar();
  int x = 0, fl = 1;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fl = -1;
  for (; isdigit(ch); ch = getchar()) x = (x << 3) + (x << 1) + (ch - '0');
  return x * fl;
}
const int NN = 100000 + 17;
void open() {
  freopen("a.in", "r", stdin);
  freopen("a.out", "w", stdout);
}
int n, m;
namespace seg {
int len[NN << 2];
long long sum[NN << 2], tag[NN << 2];
void psu(int rt) { sum[rt] = sum[rt << 1] + sum[rt << 1 | 1]; }
void set_tag(int rt, long long x) {
  tag[rt] += 1LL * x;
  sum[rt] += 1LL * len[rt] * x;
}
void psd(int rt) {
  if (tag[rt]) {
    set_tag(rt << 1, tag[rt]);
    set_tag(rt << 1 | 1, tag[rt]);
    tag[rt] = 0LL;
  }
}
void build(int rt, int l, int r) {
  len[rt] = r - l + 1;
  if (l == r) return;
  int mid = (l + r) >> 1;
  build(rt << 1, l, mid);
  build(rt << 1 | 1, mid + 1, r);
}
void modify(int rt, int l, int r, int ll, int rr, int x) {
  if (ll <= l && r <= rr) {
    set_tag(rt, x);
    return;
  }
  psd(rt);
  int mid = (l + r) >> 1;
  if (ll <= mid) modify(rt << 1, l, mid, ll, rr, x);
  if (rr > mid) modify(rt << 1 | 1, mid + 1, r, ll, rr, x);
  psu(rt);
}
long long query(int rt, int l, int r, int ll, int rr) {
  if (ll <= l && r <= rr) return sum[rt];
  psd(rt);
  int mid = (l + r) >> 1;
  long long res = 0LL;
  if (ll <= mid) res += query(rt << 1, l, mid, ll, rr);
  if (rr > mid) res += query(rt << 1 | 1, mid + 1, r, ll, rr);
  return res;
}
}  // namespace seg
struct node {
  int l, r;
  mutable int v;
  node(int _l = 0, int _r = 0, int _v = 0) {
    l = _l;
    r = _r;
    v = _v;
  }
  bool operator<(const node b) const { return l < b.l; }
};
set<node> odt;
set<node>::iterator split(int x) {
  if (x > n) return odt.end();
  set<node>::iterator it = --odt.upper_bound(node(x, 0, 0));
  if ((it->l) == x) return it;
  int l = (it->l), r = (it->r), v = (it->v);
  odt.erase(it);
  odt.insert(node(l, x - 1, v));
  return odt.insert(node(x, r, v)).first;
}
void assign(int l, int r, int v) {
  set<node>::iterator rr = split(r + 1), ll = split(l);
  odt.erase(ll, rr);
  odt.insert(node(l, r, v));
}
void update(int l, int r, int v) {
  set<node>::iterator rr = split(r + 1), ll = split(l);
  for (; ll != rr; ll++) {
    int tl = (ll->l), tr = (ll->r), tmp = (ll->v);
    seg::modify(1, 1, n, tl, tr, abs(tmp - v));
  }
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= n; i++) {
    odt.insert(node(i, i, i));
  }
  seg::build(1, 1, n);
  while (m--) {
    int opt = read(), l = read(), r = read();
    if (opt == 1) {
      int v = read();
      update(l, r, v);
      assign(l, r, v);
    } else {
      printf("%lld\n", seg::query(1, 1, n, l, r));
    }
  }
  return 0;
}
