Write a program which manipulates a sequence $A$ = {$a_0, a_1, ..., a_{n-1}$} with the following operations:

* $update(s, t, x)$: change $a_s, a_{s+1}, ..., a_t$ to $x$.
* $getSum(s, t)$: print the sum of $a_s, a_{s+1}, ..., a_t$.



Note that the initial values of $a_i ( i = 0, 1, ..., n-1 )$ are 0.

Constraints

* $1 ≤ n ≤ 100000$
* $1 ≤ q ≤ 100000$
* $0 ≤ s ≤ t < n$
* $-1000 ≤ x ≤ 1000$

Input


$n$ $q$
$query_1$
$query_2$
:
$query_q$


In the first line, $n$ (the number of elements in $A$) and $q$ (the number of queries) are given. Then, $i$-th query $query_i$ is given in the following format:


0 $s$ $t$ $x$


or


1 $s$ $t$


The first digit represents the type of the query. '0' denotes $update(s, t, x)$ and '1' denotes $find(s, t)$.

Output

For each $getSum$ query, print the sum in a line.

Example

Input

6 7
0 1 3 1
0 2 4 -2
1 0 5
1 0 1
0 3 5 3
1 3 4
1 0 5


Output

-5
1
6
8
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<list>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<ctime>
using namespace std;

typedef long long ll;

const int NIL = -1;
const int MAX = 2147483647;
const int INF = -10001;
const int N = 1000001;
clock_t START, END;
bool debug = false;

int setv[N << 2], sumv[N << 2];
int ql, qr, p, v;
int _sum;

void pushdown(int o)
{
	int lc = o * 2, rc = o * 2 + 1;
	if (setv[o] > INF) {
		setv[lc] = setv[rc] = setv[o];
		setv[o] = INF;
	}
}

void maintain(int o, int L, int R)
{
	int lc = o * 2, rc = 2 * o + 1;
	if (setv[o] > INF) {
		sumv[o] = setv[o] * (R - L + 1);
	}
	else {
		sumv[o] = sumv[lc] + sumv[rc];
	}
}

void query(int o, int L, int R, int add)
{
	int M = L + (R - L) / 2;
	if (setv[o] > INF) {
		_sum += setv[o] * (min(R, qr) - max(L, ql) + 1);
	}
	else if (ql <= L && qr >= R) {
		_sum += sumv[o];
	}
	else {
		if (ql <= M)
			query(o * 2, L, M, add + sumv[o]);
		if (qr > M)
			query(o * 2 + 1, M + 1, R, add + sumv[o]);
	}
}

void update(int o, int L, int R)
{
	int M = L + (R - L) / 2;
	int lc = o * 2, rc = o * 2 + 1;
	if (ql <= L && qr >= R) {
		setv[o] = v;
	}
	else {
		pushdown(o);
		if (ql <= M)
			update(lc, L, M);
		else
			maintain(lc, L, M);
		if (qr > M)
			update(rc, M + 1, R);
		else
			maintain(rc, M + 1, R);
	}
	maintain(o, L, R);
}


int main(void)
{
	if (debug) {
		START = clock();
		freopen("in18.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	}
	int n, q, com;
	scanf("%d%d", &n, &q);
	for (int i = 0; i <= 4 * n; i++) {
		setv[i] = INF;
		sumv[i] = 0;
	}
	for (int i = 0; i < q; i++) {
		scanf("%d", &com);
		if (com) {
			scanf("%d%d", &ql, &qr);
			ql++;
			qr++;
			_sum = 0;
			query(1, 1, n, 0);
			printf("%d\n", _sum);
		}
		else {
			scanf("%d%d%d", &ql, &qr, &v);
			ql++;
			qr++;
			update(1, 1, n);
		}
	}
	if (debug) {
		END = clock();
		double endtime = (double)(END - START) / 1000;
		printf("total time = %lf s", endtime);
	}
	return 0;
}
