#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 100010;

struct node
{
    int l, r;
    int sum;
    int lazy;
}tr[N * 4];
int a[N];

void maketag(int u, int len, int x)
{
    tr[u].lazy += x;
    tr[u].sum += len * x;
}

void pushdown(int u, int l, int r)
{
    int mid = l + r >> 1;
    maketag(u << 1, mid - l + 1, tr[u].lazy);
    maketag(u << 1 | 1, r - mid, tr[u].lazy);
    tr[u].lazy = 0;
}

void pushup(int u)
{
    tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}

void build(int u, int l, int r)
{
    tr[u] = {l, r};
    if (l == r)
    {
        tr[u].sum = a[l];
        return;
    }
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
    pushup(u);
}

int query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
    else if (!(tr[u].l > r || tr[u].r < l))
    {
        int mid = tr[u].l + tr[u].r >> 1;
        pushdown(u, tr[u].l, tr[u].r);
        return query(u << 1, l, mid) + query(u << 1 | 1, mid + 1, r);
    }
    else return 0;
}

void update(int u, int l, int r, int x)
{
    if (tr[u].l >= l && tr[u].r <= r) maketag(u, r - l + 1, x);
    else if (tr[u].l > r || tr[u].r < l) return;
    else
    {
        int mid = tr[u].l + tr[u].r >> 1;
        pushdown(u, tr[u].l, tr[u].r);
        update(u << 1, l, mid, x);
        update(u << 1 | 1, mid + 1, r, x);
        pushup(u);
    }
}

signed main()
{
    int n, m;
    cin >> n >> m;

    for (int i = 1 ; i <= n ; i ++)
        scanf("%lld", &a[i]);

    build(1, 1, n);

    while (m --)
    {
        int op, x, y, k;
        cin >> op;
        if (op == 1)
        {
            scanf("%lld%lld%lld", &x, &y, &k);
            update(1, x, y, k);
        }
        else
        {
            scanf("%lld%lld", &x, &y);
            printf("%lld\n", query(1, x, y));
        }
    }

    return 0;
}