Hongjun Loves Painting

Hongjun loves painting.

Hongjun got $n$ bricks as a birthday present and laid them out in a row. The leftmost brick is brick 1, the numbers grow by 1 toward the right, and the rightmost brick is brick $n$. At the start, brick $i$ has color $i$, and the colorfulness of every brick is 0.

Hongjun paints a contiguous range of bricks in one color. If brick $i$ currently has color $y$ and Hongjun paints it with color $x$, the colorfulness of that brick grows by $|x-y|$ and its color becomes $x$.

Hongjun performs $m$ operations. Each operation is one of the following two.

1. Paint bricks $L$ through $R$ with color $X$.
2. Compute the sum of colorfulness over bricks $L$ through $R$.

Write a program that helps Hongjun.

The first line contains the number of bricks $n$ and the number of operations $m$. ($1 \le n, m \le 100\,000$)

Each of the next $m$ lines contains one operation. Every line starts with an integer $Type$ (1 or 2) that gives the kind of operation.

If $Type$ is 1, the integers $L$, $R$, $X$ of operation 1 follow. ($1 \le L \le R \le n$, $1 \le X \le 100\,000\,000$)

If $Type$ is 2, the integers $L$, $R$ of operation 2 follow. ($1 \le L \le R \le n$)

Every time an operation of type 2 runs, print the sum of colorfulness over that range on one line, in the order the operations are given.