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;
void do_nothing() {}
struct Node {
  pair<int, int> bounds;
  int color;
  long long add;
  long long sum;
  Node *lch;
  Node *rch;
  Node *par;
  Node(int i = -1)
      : bounds{i, i}, color(i + 1), add(0), sum(0), lch(0), rch(0), par(0) {}
  Node(Node *s1, Node *s2)
      : bounds{s1->bounds.first, s2->bounds.second},
        color(-1),
        add(0),
        sum(0),
        lch(s1),
        rch(s2) {
    s1->par = this;
    s2->par = this;
  }
};
Node *tree = 0;
void init_tree(int n) {
  int lvs = 1 << (int)(ceil(log2(n)));
  tree = new Node[2 * lvs - 1];
  for (int i = 0; i < lvs; ++i) tree[lvs + i - 1] = Node(i);
  for (int i = lvs - 2; i >= 0; --i)
    tree[i] = Node(&tree[2 * i + 1], &tree[2 * i + 2]);
}
pair<int, int> intersect(pair<int, int> s1, pair<int, int> s2) {
  return pair<int, int>(max(s1.first, s2.first), min(s1.second, s2.second));
}
bool correct(pair<int, int> s) { return s.first <= s.second; }
long long len(pair<int, int> s) { return s.second - s.first + 1; }
long long get_sum(pair<int, int> s, Node *v) {
  if (v->bounds == s) {
    return v->sum + v->add * len(s);
  }
  v->lch->add += v->add;
  v->rch->add += v->add;
  v->add = 0;
  pair<int, int> le = intersect(v->lch->bounds, s);
  pair<int, int> ri = intersect(v->rch->bounds, s);
  long long ret = 0;
  if (correct(le)) ret += get_sum(le, v->lch);
  if (correct(ri)) ret += get_sum(ri, v->rch);
  v->sum = v->lch->sum + v->rch->sum + v->lch->add * len(v->lch->bounds) +
           v->rch->add * len(v->rch->bounds);
  return ret;
}
long long get_sum(int l, int r) {
  return get_sum(pair<int, int>(l, r), &tree[0]);
}
void update(pair<int, int> s, int color, Node *v) {
  if (v->bounds == s && v->color != -1) {
    v->add += abs(v->color - color);
    v->color = color;
    return;
  }
  if (v->color != -1) {
    v->lch->color = v->color;
    v->rch->color = v->color;
  }
  pair<int, int> le = intersect(v->lch->bounds, s);
  pair<int, int> ri = intersect(v->rch->bounds, s);
  if (correct(le)) update(le, color, v->lch);
  if (correct(ri)) update(ri, color, v->rch);
  v->sum = v->lch->sum + v->rch->sum + v->lch->add * len(v->lch->bounds) +
           v->rch->add * len(v->rch->bounds);
  if (v->bounds == s)
    v->color = color;
  else
    v->color = -1;
}
void solve() {
  int n, m;
  scanf("%d %d", &n, &m);
  init_tree(n);
  for (int(i) = 0; (i) < (m); (i)++) {
    int cmd;
    scanf("%d", &cmd);
    if (cmd == 1) {
      int l, r, x;
      scanf("%d %d %d", &l, &r, &x);
      --l;
      --r;
      if (r == 89871) do_nothing();
      if (r == 44652) do_nothing();
      update(pair<int, int>(l, r), x, tree);
    } else {
      int l, r;
      scanf("%d %d", &l, &r);
      --l;
      --r;
      cout << get_sum(l, r) << "\n";
    }
  }
}
int main() {
  solve();
  return 0;
}
