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>
long long myAbs(long long n) { return n > 0 ? n : -n; }
struct A {
  int color;
  long long val;
  long long tag;
} st[2 * (1 << 17)];
void init() {
  for (int i = 1; i < (1 << 17); ++i) {
    st[i].color = 0;
    st[i].val = st[i].tag = 0;
  }
  for (int i = (1 << 17); i < 2 * (1 << 17); ++i) {
    st[i].color = i - (1 << 17) + 1;
    st[i].val = st[i].tag = 0;
  }
}
void update(int lft, int rgt, int c, int idx = 1, int l = 1,
            int r = (1 << 17)) {
  if (lft > r || rgt < l) return;
  if (lft <= l && rgt >= r) {
    if (st[idx].color != 0) {
      st[idx].tag += myAbs(c - st[idx].color);
      st[idx].color = c;
    } else {
      st[idx].color = c;
      int m = (l + r) / 2;
      update(lft, rgt, c, idx * 2, l, m);
      update(lft, rgt, c, idx * 2 + 1, m + 1, r);
      st[idx].val = st[idx * 2].val + st[idx * 2].tag * (m - l + 1) +
                    st[idx * 2 + 1].val + st[idx * 2 + 1].tag * (r - m);
    }
  } else {
    if (st[idx].color != 0) {
      st[idx * 2].color = st[idx].color;
      st[idx * 2].tag += st[idx].tag;
      st[idx * 2 + 1].color = st[idx].color;
      st[idx * 2 + 1].tag += st[idx].tag;
      st[idx].color = 0;
      st[idx].tag = 0;
    }
    int m = (l + r) / 2;
    update(lft, rgt, c, idx * 2, l, m);
    update(lft, rgt, c, idx * 2 + 1, m + 1, r);
    st[idx].val = st[idx * 2].val + st[idx * 2].tag * (m - l + 1) +
                  st[idx * 2 + 1].val + st[idx * 2 + 1].tag * (r - m);
  }
}
long long query(int lft, int rgt, int idx = 1, int l = 1, int r = (1 << 17)) {
  if (lft > r || rgt < l) return 0;
  if (lft <= l && rgt >= r) return st[idx].val + st[idx].tag * (r - l + 1);
  long long t1, t2;
  int tl, tr;
  int m = (l + r) / 2;
  t1 = query(lft, rgt, idx * 2, l, m);
  t2 = query(lft, rgt, idx * 2 + 1, m + 1, r);
  tl = (lft > l ? (lft) : (l));
  tr = (rgt < r ? (rgt) : (r));
  return t1 + t2 + st[idx].tag * (tr - tl + 1);
}
int main() {
  int n, m;
  int type, lft, rgt, color;
  scanf("%d%d", &n, &m);
  init();
  while (m--) {
    scanf("%d", &type);
    if (type == 1) {
      scanf("%d%d%d", &lft, &rgt, &color);
      update(lft, rgt, color);
    }
    if (type == 2) {
      scanf("%d%d", &lft, &rgt);
      printf("%I64d\n", query(lft, rgt));
    }
  }
  return 0;
}
