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 mod = 1e9 + 7;
const int maxn = 1e5 + 50;
const long long inf = 0x3f3f3f3f3f3f3f3fLL;
int n, m;
void read(int &res) {
  res = 0;
  char c;
  while (c = getchar(), c < 48)
    ;
  do res = (res << 3) + (res << 1) + (c ^ 48);
  while (c = getchar(), c > 47);
}
inline void out(long long x) {
  if (x > 9) out(x / 10);
  putchar(x % 10 + '0');
}
struct Segment_Tree {
  struct Node {
    int L, R, same;
    long long tag, sum;
    inline int len() { return R - L + 1; }
  } tree[maxn << 2];
  void build(int L, int R, int k = 1) {
    tree[k] = (Node){L, R, -1, 0, 0};
    if (L == R) {
      tree[k].same = L;
      return;
    }
    int mid = L + R >> 1;
    build(L, mid, (k << 1));
    build(mid + 1, R, (k << 1 | 1));
  }
  inline void push_up(int k) {
    tree[k].sum = tree[(k << 1)].sum + tree[(k << 1 | 1)].sum;
    if (tree[(k << 1)].same != tree[(k << 1 | 1)].same)
      tree[k].same = -1;
    else
      tree[k].same = tree[(k << 1)].same;
  }
  void update(int k, long long val, int col) {
    tree[k].tag += val;
    tree[k].sum += 1ll * tree[k].len() * val;
    tree[k].same = col;
  }
  void push_down(int k) {
    if (!tree[k].tag) return;
    update((k << 1), tree[k].tag, tree[k].same);
    update((k << 1 | 1), tree[k].tag, tree[k].same);
    tree[k].tag = 0;
  }
  void modify(int L, int R, int val, int k = 1) {
    if (tree[k].L == L && tree[k].R == R && ~tree[k].same) {
      update(k, abs(val - tree[k].same), val);
      return;
    }
    int mid = tree[k].L + tree[k].R >> 1;
    push_down(k);
    if (R <= mid)
      modify(L, R, val, (k << 1));
    else if (L > mid)
      modify(L, R, val, (k << 1 | 1));
    else {
      modify(L, mid, val, (k << 1));
      modify(mid + 1, R, val, (k << 1 | 1));
    }
    push_up(k);
  }
  long long query(int L, int R, int k = 1) {
    if (tree[k].L == L && tree[k].R == R) return tree[k].sum;
    int mid = tree[k].L + tree[k].R >> 1;
    push_down(k);
    if (R <= mid) return query(L, R, (k << 1));
    if (L > mid) return query(L, R, (k << 1 | 1));
    return query(L, mid, (k << 1)) + query(mid + 1, R, (k << 1 | 1));
  }
} seg;
int main() {
  read(n);
  read(m);
  seg.build(1, n);
  while (m--) {
    int type, l, r, val;
    read(type);
    if (type == 1) {
      read(l);
      read(r);
      read(val);
      seg.modify(l, r, val);
    } else {
      read(l);
      read(r);
      out(seg.query(l, r));
      puts("");
    }
  }
  return 0;
}
