DZY loves colors

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?


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.


Sample Input
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

#include<stdio.h>
#include<math.h>
#include<string.h>
int main( )
{
    int n,m,i,j,choose,l,r,x,count;
    int color[100002];
    int colorf[100002];
    int sum[100002];
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(sum,0,sizeof(sum));
        memset(colorf,0,sizeof(colorf));
        for(i=1;i<=n;i++)
            color[i]=i;
        count=0;
        for(i=0;i<m;i++)
        {
            scanf("%d",&choose);
            if(choose==1)
            {
                scanf("%d%d%d",&l,&r,&x);
                for(j=l;j<=r;j++)
                    {colorf[j]+=(abs(color[j]-x));color[j]=x;}
            }
            if(choose==2)
            {
                scanf("%d%d",&l,&r);
                for(j=l;j<=r;j++)
                    sum[count]+=colorf[j];
                count++;
            }
        }
         for(i=0;i<count;i++)
                    printf("%d\n",sum[i]);
    }
    return 0;
}