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:
-
Paint all the units with numbers between l and r (both inclusive) with color x.
-
Ask the sum of colorfulness of the units between l and r (both inclusive).
Can you help DZY?
Output
For each operation
2, print a line containing the answer − sum of colorfulness.
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.