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;
inline int getnum() {
  int ans = 0, fh = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') fh *= -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') ans = ans * 10 + ch - '0', ch = getchar();
  return fh * ans;
}
struct node {
  int l, r, size, num;
  long long sum, ia;
  bool same;
} t[610000];
void construct(int l, int r, int k) {
  t[k].l = l;
  t[k].r = r;
  t[k].size = r - l + 1;
  t[k].sum = t[k].ia = 0;
  if (l == r) {
    t[k].num = l;
    t[k].same = true;
    return;
  } else {
    t[k].num = 0;
    t[k].same = false;
    int mid = (l + r) / 2;
    construct(l, mid, 2 * k);
    construct(mid + 1, r, 2 * k + 1);
  }
}
inline void pushdown(int k) {
  if (t[k].ia) {
    if (t[k].l < t[k].r) {
      t[2 * k].sum += t[k].ia * t[2 * k].size;
      t[2 * k].ia += t[k].ia;
      t[2 * k + 1].sum += t[k].ia * t[2 * k + 1].size;
      t[2 * k + 1].ia += t[k].ia;
    }
    t[k].ia = 0;
  }
  if (t[k].same) {
    t[2 * k].same = true;
    t[2 * k].num = t[k].num;
    t[2 * k + 1].same = true;
    t[2 * k + 1].num = t[k].num;
  }
}
void chgcol(int l, int r, int c, int k) {
  pushdown(k);
  if (t[k].l == l && t[k].r == r && t[k].same) {
    t[k].sum += (long long)abs(c - t[k].num) * t[k].size;
    t[k].ia += (long long)abs(c - t[k].num);
    t[k].same = true;
    t[k].num = c;
    return;
  }
  int mid = (t[k].l + t[k].r) / 2;
  if (l > mid)
    chgcol(l, r, c, 2 * k + 1);
  else if (r <= mid)
    chgcol(l, r, c, 2 * k);
  else
    chgcol(l, mid, c, 2 * k), chgcol(mid + 1, r, c, 2 * k + 1);
  t[k].sum = t[2 * k].sum + t[2 * k + 1].sum;
  t[k].same = false;
  t[k].num = 0;
  if (t[2 * k].same && t[2 * k + 1].same && t[2 * k].num == t[2 * k + 1].num)
    t[k].same = true, t[k].num = t[2 * k].num;
}
long long getsum(int l, int r, int k) {
  pushdown(k);
  if (t[k].l == l && t[k].r == r) return t[k].sum;
  int mid = (t[k].l + t[k].r) / 2;
  if (l > mid)
    return getsum(l, r, 2 * k + 1);
  else if (r <= mid)
    return getsum(l, r, 2 * k);
  else
    return getsum(l, mid, 2 * k) + getsum(mid + 1, r, 2 * k + 1);
}
int main(int argc, char *argv[]) {
  int n = getnum(), m = getnum();
  construct(1, n, 1);
  while (m--) {
    if (getnum() == 1) {
      int l = getnum(), r = getnum(), c = getnum();
      chgcol(l, r, c, 1);
    } else {
      int l = getnum(), r = getnum();
      printf("%I64d\n", getsum(l, r, 1));
    }
  }
  return 0;
}
