#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
const int N = 100010;
int w[N];
int n, m;
struct node
{
int l, r;
LL sum, add;
}tr[N * 4];
void push_up(int u)
{
tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}
void push_down(int u)
{
node &root = tr[u], &left = tr[u << 1], &right = tr[u << 1 | 1]; 、
if (root.add)
{
left.sum += root.add * (left.r - left.l + 1);
right.sum += root.add * (right.r - right.l + 1);
left.add += root.add;
right.add += root.add;
root.add = 0;
}
}
void build(int u, int l, int r)
{
if (l == r)
tr[u] = {l, r, w[l], 0};
else
{
tr[u] = {l, r};
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
push_up(u);
}
}
void modify(int u, int l, int r, int d)
{
if (tr[u].l >= l && tr[u].r <= r)
{
tr[u].sum += (LL)d * (tr[u].r - tr[u].l + 1);
tr[u].add += d;
}
else
{
push_down(u);
int mid = tr[u].l + tr[u].r >> 1;
if (l <= mid) modify(u << 1, l, r, d);
if (r > mid) modify(u << 1 | 1, l, r, d);
push_up(u);
}
}
LL query(int u, int l, int r)
{
if (tr[u].l >= l && tr[u].r <= r)
return tr[u].sum;
else
{
push_down(u);
int mid = tr[u].l + tr[u].r >> 1;
LL sum = 0;
if (l <= mid) sum += query(u << 1, l, r);
if (r > mid) sum += query(u << 1 | 1, l ,r);
return sum;
}
}
int main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i ++) cin >> w[i];
build(1, 1, n);
while (m --)
{
char ch;
cin >> ch;
if (ch == 'Q')
{
int l, r;
cin >> l >> r;
cout << query(1, l, r) << endl;
}
else
{
int l, r, k;
cin >> l >> r >> k;
modify(1, l, r, k);
}
}
return 0;
}