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 int maxn = 1e5 + 50;
const int maxm = 1e6 + 50;
const double eps = 1e-10;
const int max_index = 62;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int read() {
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  int x = 0;
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x;
}
long long sum[maxn << 2];
long long col[maxn << 2], dis[maxn << 2];
void pushup(int id) {
  sum[id] = sum[id << 1] + sum[id << 1 | 1];
  if (col[id << 1] == col[id << 1 | 1])
    col[id] = col[id << 1];
  else
    col[id] = -1;
}
void pushdown(int id, int l, int r) {
  if (dis[id]) {
    int mid = l + r >> 1;
    col[id << 1] = col[id << 1 | 1] = col[id];
    dis[id << 1] += dis[id];
    dis[id << 1 | 1] += dis[id];
    sum[id << 1] += (mid - l + 1) * dis[id];
    sum[id << 1 | 1] += (r - mid) * dis[id];
    dis[id] = 0;
  }
}
void build(int id, int l, int r) {
  sum[id] = 0;
  col[id] = -1;
  if (l == r) {
    col[id] = l;
    return;
  }
  int mid = l + r >> 1;
  build(id << 1, l, mid);
  build(id << 1 | 1, mid + 1, r);
  pushup(id);
}
void update(int id, int l, int r, int L, int R, int val) {
  if (L <= l && r <= R) {
    if (col[id] != -1) {
      sum[id] += 1LL * abs(val - col[id]) * (r - l + 1);
      dis[id] += abs(val - col[id]);
      col[id] = val;
      return;
    }
  }
  pushdown(id, l, r);
  int mid = l + r >> 1;
  if (mid >= L) update(id << 1, l, mid, L, R, val);
  if (mid < R) update(id << 1 | 1, mid + 1, r, L, R, val);
  pushup(id);
}
long long query(int id, int l, int r, int L, int R) {
  if (L <= l && r <= R) return sum[id];
  pushdown(id, l, r);
  long long res = 0;
  int mid = l + r >> 1;
  if (mid >= L) res += query(id << 1, l, mid, L, R);
  if (mid < R) res += query(id << 1 | 1, mid + 1, r, L, R);
  return res;
}
int main() {
  int n = read(), m = read();
  build(1, 1, n);
  while (m--) {
    int op = read();
    if (op == 1) {
      int l = read(), r = read(), val = read();
      update(1, 1, n, l, r, val);
    } else {
      int l = read(), r = read();
      printf("%I64d\n", query(1, 1, n, l, r));
    }
  }
  return 0;
}
