#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
using namespace std;
typedef struct TSplayNode {
	int key, cover, size;
	__int64 data, sum;
	TSplayNode *lch, *rch, *pnt;
}*PSplayNode;
int n, q;
PSplayNode root;
 
void CoverExpand(PSplayNode cur) {
	if (cur->lch != NULL) {
		cur->lch->cover += cur->cover;
		cur->lch->data += cur->cover;
		cur->lch->sum += ((__int64)cur->cover) * cur->lch->size;
	}
	if (cur->rch != NULL) {
		cur->rch->cover += cur->cover;
		cur->rch->data += cur->cover;
		cur->rch->sum += ((__int64)cur->cover) * cur->rch->size;
	}
	cur->cover = 0;
}
 
void Update(PSplayNode cur) {
	cur->size = 1;
	if (cur->lch != NULL) cur->size += cur->lch->size;
	if (cur->rch != NULL) cur->size += cur->rch->size;
	if (cur->cover != 0) CoverExpand(cur);
	cur->sum = cur->data;
	if (cur->lch != NULL) cur->sum += cur->lch->sum;
	if (cur->rch != NULL) cur->sum += cur->rch->sum;
}
 
void LeftRotate(PSplayNode cur) {
	PSplayNode pnt = cur->pnt, anc = pnt->pnt;
	if (anc != NULL && anc->cover != 0) CoverExpand(anc);
	if (pnt->cover != 0) CoverExpand(pnt);
	if (cur->cover != 0) CoverExpand(cur);
	pnt->lch = cur->rch; if (cur->rch != NULL) cur->rch->pnt = pnt;
	cur->rch = pnt; pnt->pnt = cur;
	cur->pnt = anc;
	if (anc != NULL) {
		if (anc->lch == pnt) anc->lch = cur;
		else anc->rch = cur;
	}
	Update(pnt); Update(cur);
}
 
void RightRotate(PSplayNode cur) {
	PSplayNode pnt = cur->pnt, anc = pnt->pnt;
	if (anc != NULL && anc->cover != 0) CoverExpand(anc);
	if (pnt->cover != 0) CoverExpand(pnt);
	if (cur->cover != 0) CoverExpand(cur);
	pnt->rch = cur->lch; if (cur->lch != NULL) cur->lch->pnt = pnt;
	cur->lch = pnt; pnt->pnt = cur;
	cur->pnt = anc;
	if (anc != NULL) {
		if (anc->lch == pnt) anc->lch = cur;
		else anc->rch = cur;
	}
	Update(pnt); Update(cur);
}
 
void splay(PSplayNode cur) {
	PSplayNode pnt, anc;
	while (cur->pnt != NULL) {
		pnt = cur->pnt;
		anc = pnt->pnt;
		if (anc != NULL && anc->cover != 0) CoverExpand(anc);
		if (pnt->cover != 0) CoverExpand(pnt);
		if (cur->cover != 0) CoverExpand(cur);
		if (anc == NULL) {
			if (pnt->lch == cur) LeftRotate(cur);
			else RightRotate(cur);
		} else {
			if (pnt->lch == cur) LeftRotate(cur);
			else RightRotate(cur);
			if (anc->lch == cur) LeftRotate(cur);
			else RightRotate(cur);
		}
	}
	root = cur;
}
 
PSplayNode find(PSplayNode cur, int key) {
	while (cur->key != key) {
		if (cur->cover != 0) CoverExpand(cur);
		if (key < cur->key) {
			if (cur->lch == NULL) break;
			cur = cur->lch;
		}
		else if (key > cur->key) {
			if (cur->rch == NULL) break;
			cur = cur->rch;
		}
	}
	return cur;
}
 
void Insert(int key, int data) {
	PSplayNode cur = new(TSplayNode);
	memset(cur, 0, sizeof(TSplayNode));
	cur->key = key; cur->data = cur->sum = data; cur->size = 1;
	if (root == NULL) root = cur;
	else {
		splay(find(root, key));
		if (root->key < key) {
			cur->rch = root->rch;
			if (root->rch != NULL) root->rch->pnt = cur;
			root->rch = NULL; cur->lch = root;
		} else if (root->key > key) {
			cur->lch = root->lch;
			if (root->lch != NULL) root->lch->pnt = cur;
			root->lch = NULL; cur->rch = root;
		}
		root->pnt = cur;
		Update(root); Update(cur);
		root = cur;
	}
}
 
int main() {
	scanf("%d%d", &n, &q);
	root = NULL;
	Insert(0, 0);
	for (int i = 0; i < n; ++ i) {
		int a;
		scanf("%d", &a);
		Insert(i + 1, a);
	}
	Insert(n + 1, 0);
	scanf("\n");
	for (int i = 0; i < q; ++ i) {
		char c;
		int a, b, p;
		PSplayNode tmp;
		scanf("%c", &c);
		if (c == 'Q') {
			scanf("%d%d\n", &a, &b);
			splay(find(root, a - 1));
			tmp = root; root->rch->pnt = NULL;
			splay(find(root->rch, b + 1));
			cout << root->lch->sum << endl;
			root->pnt = tmp;
			tmp->rch = root;
			root = tmp;
		} else {
			scanf("%d%d%d\n", &a, &b, &p);
			splay(find(root, a - 1));
			tmp = root; root->rch->pnt = NULL;
			splay(find(root->rch, b + 1));
			root->lch->cover += p;
			root->lch->data += p;
			root->lch->sum += ((__int64)p) * root->lch->size;
			root->pnt = tmp;
			tmp->rch = root;
			root = tmp;
		}
	}
}

{	NetworkFlow_MaxFlow_MPLA	}
const	Infinity=maxlongint;
	MaxNode=100;
	MaxEdge=1000;
type	TEdge=record
		Start,Target,Next,Capa,Flow:longint;
	end;
var	Edge:array[-MaxEdge..MaxEdge]of TEdge;
	Head,Dist:array[1..MaxNode]of longint;
	Queue,Pre:array[0..MaxNode]of longint;
	Used:array[1..MaxNode]of boolean;
	Stack,StackEdge:array[1..MaxNode]of longint;
	Source,Sink,EdgeNum,QHead,QTail,TotalFlow,Delta:longint;
procedure InsertEdge(FStart,FTarget,FCapa:longint);
begin
	inc(EdgeNum);
	with Edge[EdgeNum] do
	begin
		Start:=FStart;
		Target:=FTarget;
		Capa:=FCapa;
		Next:=Head[FStart];
		Head[FStart]:=EdgeNum;
	end;
	with Edge[-EdgeNum] do
	begin
		Start:=FTarget;
		Target:=FStart;
		Next:=Head[FTarget];
		Head[FTarget]:=-EdgeNum;
	end;
end;
function SetDistLabel:boolean;
var	Start,Ptr,QHead,QTail:longint;
begin
	fillchar(Dist,sizeof(Dist),0);
	QHead:=1;QTail:=0;
	Queue[0]:=Source;Dist[Source]:=1;
	while QHead>QTail do
	begin
		Start:=Queue[QTail];inc(QTail);
		Ptr:=Head[Start];
		while Ptr<>0 do
			with Edge[Ptr] do
			begin
				if (Dist[Target]=0)and(Flow<Capa) then
				begin
					Dist[Target]:=Dist[Start]+1;
					Queue[QHead]:=Target;inc(QHead);
				end;
				Ptr:=Next;
			end;
	end;
	SetDistLabel:=(Dist[Sink]>0);
end;
function FindPath(Start:Longint):boolean;
var	Ptr:Longint;
begin
	Used[Start]:=True;
	if Start=Sink then
		exit(True);
	Ptr:=Head[Start];
	while Ptr<>0 do
		with Edge[Ptr] do
		begin
			if (Dist[Start]+1=Dist[Target])and(not Used[Target])and(Flow<Capa) then
				if FindPath(Target) then
				begin
					Pre[Target]:=Ptr;
					if Delta>Capa-Flow then Delta:=Capa-Flow;
					exit(True);
				end;
			Ptr:=Next;
		end;
	FindPath:=False;
end;
procedure IncFlow(Delta:Longint);
var	Now,Ptr:longint;
begin
	Inc(TotalFlow,Delta);
	Now:=Sink;
	repeat
		Ptr:=Pre[Now];
		Inc(Edge[Ptr].Flow,Delta);
		Edge[-Ptr].Flow:=Edge[-Ptr].Flow-Delta;
		Now:=Edge[Ptr].Start;
	until Now=Source;
end;
procedure MPLA;
begin
	while SetDistLabel do
	begin
		Delta:=maxlongint;
		fillchar(Used,sizeof(Used),0);
		fillchar(Pre,sizeof(Pre),0);
		while FindPath(Source) do
		begin
			IncFlow(Delta);
			Delta:=maxlongint;
			fillchar(Used,sizeof(Used),0);
			fillchar(Pre,sizeof(Pre),0);
		end;
	end;
	writeln(TotalFlow);
end;
begin
end.

{	NetworkFlow_MaxFlow_Dinic	}
const	Infinity=maxlongint;
	MaxNode=100;
	MaxEdge=1000;
type	THead=array[1..MaxNode]of longint;
	TEdge=record
		Target,Next,Capa,Flow:longint;
	end;
var	Edge:array[-MaxEdge..MaxEdge]of TEdge;
	Head,Bak,Dist:THead;
	Queue:array[0..MaxNode]of longint;
	Stack,StackEdge:array[1..MaxNode]of longint;
	Source,Sink,EdgeNum,QHead,QTail,TotalFlow:longint;
procedure AddEdge(A,B,W:longint);
begin
	Inc(EdgeNum);
	with Edge[EdgeNum] do
	begin
		Target:=B;
		Capa:=W;
		Next:=Head[A];
		Head[A]:=EdgeNum;
	end;
	with Edge[-EdgeNum] do
	begin
		Target:=A;
		Next:=Head[B];
		Head[B]:=-EdgeNum;
	end;
end;
function SetDistLabel:boolean;
var	Start,Ptr:longint;
begin
	fillchar(Dist,sizeof(Dist),0);
	QHead:=1;QTail:=0;
	Queue[0]:=Source;Dist[Source]:=1;
	while QHead>QTail do
	begin
		Start:=Queue[QTail];inc(QTail);
		Ptr:=Head[Start];
		while Ptr<>0 do
			with Edge[Ptr] do
			begin
				if (Dist[Target]=0)and(Flow<Capa) then
				begin
					Dist[Target]:=Dist[Start]+1;
					Queue[QHead]:=Target;inc(QHead);
				end;
				Ptr:=Next;
			end;
	end;
	SetDistLabel:=(Dist[Sink]>0);
end;
function Argument(Top:longint):longint;
var	i,Delta,T:longint;
begin
	Delta:=Infinity;
	for i:=1 to Top do
		with Edge[StackEdge[i]] do
			if Delta>Capa-Flow then Delta:=Capa-Flow;
	inc(TotalFLow,Delta);
	for i:=Top downto 1 do
		with Edge[StackEdge[i]] do
		begin
			inc(Flow,Delta);
			Dec(Edge[-StackEdge[i]].Flow,Delta);
			if Flow=Capa then T:=i;
		end;
	Argument:=T;
end;
procedure FindFlow;
var	Top,Start,Ptr:longint;
begin
	Top:=1;Stack[Top]:=Source;
	while Top>0 do
	begin
		Start:=Stack[Top];
		if Start=Sink then
		begin
			Top:=Argument(Top-1);
			Start:=Stack[Top];
		end;
		while Head[Start]<>0 do
			with Edge[Head[Start]] do
			begin
				Ptr:=Head[Start];
				Head[Start]:=Next;
				if (Dist[Target]=Dist[Start]+1)and(Capa>Flow) then
				begin
					StackEdge[Top]:=Ptr;
					Inc(Top,2);
					Stack[Top-1]:=Target;
					break;
				end;
			end;
		dec(Top);
	end;
end;
procedure Dinic;
begin
	while SetDistLabel do
		FindFlow;
end;
begin
end.

#include <stdio.h>
#include <memory.h>
 
int n,a[15001],b[15001],ans[15001],tree[60000],t;
 
int Query(int a)
{
	if (!a)
		return tree[0];
	int ans = 0;
	while (a)
	{
		ans += tree[a];
		a -= (a & (-a));
	}
	return ans + tree[0];
}
 
void update(int a)
{
	if (!a) { ++ tree[0]; return; }
	while (a <= 32768)
	{
		++ tree[a];
		a += (a & (-a));
	}
}
 
int main()
{
	freopen("input.txt","r",stdin);
	scanf("%d",&n);
	for (int i=1; i<=n; ++i)
		scanf("%d %d",&a[i],&b[i]);
	for (int i=1; i<=n; ++i)
	{
		update(a[i]);
		t = Query(a[i]);
		++ ans[t];
	}
	for (int i=1; i<=n; ++i)
		printf("%d\n",ans[i]);
}