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

const int nmax=2e5+42;

int n,m,k,inp[nmax];

struct info
{
    long long id_max,maxi,lazy,sum,sz;
};
info tree[3][nmax*4],idle;

/*
id=0-> normal
id=1-> with <=m
id=2-> with penalty
*/
info actual(info cur)
{
    cur.maxi+=cur.lazy;
    cur.sum+=cur.lazy*cur.sz;
    cur.lazy=0;
    return cur;
}
info my_merge(info a,info b)
{
    a=actual(a);
    b=actual(b);

    info ret;
    ret.sz=a.sz+b.sz;
    ret.sum=a.sum+b.sum;
    ret.lazy=0;

    if(a.maxi<b.maxi)swap(a,b);

    ret.id_max=a.id_max,ret.maxi=a.maxi;

    return ret;
}
void build(int id,int node,int l,int r)
{
    if(l==r)
    {
        tree[id][node].sz=1;
        tree[id][node].maxi=inp[l];
        tree[id][node].sum=inp[l];
        tree[id][node].lazy=0;
        tree[id][node].id_max=l;
        return;
    }

    int av=(l+r)/2;

    build(id,node*2,l,av);
    build(id,node*2+1,av+1,r);

    tree[id][node]=my_merge(tree[id][node*2],tree[id][node*2+1]);
}

void push(int id,int node)
{
    tree[id][node*2].lazy+=tree[id][node].lazy;
    tree[id][node*2+1].lazy+=tree[id][node].lazy;
    tree[id][node].lazy=0;
}
info query_sum(int id,int node,int l,int r,int lq,int rq)
{
    if(l==lq&&r==rq)
    {
        //cout<<id<<" "<<node<<" -> "<<tree[id][node].maxi<<" "<<tree[id][node].lazy<<endl;

        return actual(tree[id][node]);
    }

    push(id,node);

    info ret=idle;

    int av=(l+r)/2;

    if(lq<=av)ret=my_merge(ret,query_sum(id,node*2,l,av,lq,min(av,rq)));
    if(av<rq)ret=my_merge(ret,query_sum(id,node*2+1,av+1,r,max(av+1,lq),rq));

    tree[id][node]=my_merge(tree[id][node*2],tree[id][node*2+1]);

    //cout<<l<<" "<<r<<" , "<<lq<<" "<<rq<<" -> "<<ret.lazy<<" "<<ret.sum<<" "<<ret.sz<<endl;

    return ret;
}

void update(int id,int node,int l,int r,int lq,int rq,long long cur)
{
    if(l==lq&&r==rq)
    {
        //cout<<"update "<<id<<" "<<node<<" "<<lq<<" "<<rq<<" "<<cur<<endl;

        tree[id][node].lazy+=cur;

        return;
    }

    push(id,node);

    int av=(l+r)/2;

    if(lq<=av)update(id,node*2,l,av,lq,min(av,rq),cur);
    if(av<rq)update(id,node*2+1,av+1,r,max(av+1,lq),rq,cur);

    tree[id][node]=my_merge(tree[id][node*2],tree[id][node*2+1]);
}

void make_active(int id,int node,int l,int r,int pos)
{
    if(l==r)
    {
        tree[id][node].sz=1;
        tree[id][node].lazy=0;
        return;
    }

    push(id,node);

    int av=(l+r)/2;

    if(pos<=av)make_active(id,node*2,l,av,pos);
    else make_active(id,node*2+1,av+1,r,pos);

    tree[id][node]=my_merge(tree[id][node*2],tree[id][node*2+1]);
}
void make_update()
{
    int l,r,val;

    scanf("%i%i%i",&l,&r,&val);

    update(0,1,1,n,l,r,val);
    update(1,1,1,n,l,r,val);
    update(2,1,1,n,l,r,val);

    while(actual(tree[1][1]).maxi>m)
    {
        int pos=tree[1][1].id_max;

        //cout<<"pos= "<<pos<<" "<<actual(tree[1][1]).maxi<<endl;

        long long cur=query_sum(1,1,1,n,pos,pos).sum;

        //cout<<"cur= "<<cur<<endl;

        make_active(2,1,1,n,pos);

        update(2,1,1,n,pos,pos,cur-m);

        update(1,1,1,n,pos,pos,-1e18);

        //system("pause");
    }

    /*
    for(int i=1;i<=n;i++)
        cout<<i<<" -> "<<query_sum(0,1,1,n,i,i).sum<<" "<<query_sum(2,1,1,n,i,i).sum<<endl;
    */
}

void build(int node,int l,int r)
{
    build(0,1,1,n);
    build(1,1,1,n);
}
void solve_query()
{
    int l,r;

    scanf("%i%i",&l,&r);

    unsigned long long u=query_sum(0,1,1,n,l,r).sum,v=query_sum(2,1,1,n,l,r).sum;

    long long diff=u-v;

    printf("%lld\n",diff);
}

int main()
{

    freopen("investments.in","r",stdin);
    freopen("investments.out","w",stdout);


    scanf("%i%i%i",&n,&m,&k);
    for(int i=1;i<=n;i++)scanf("%i",&inp[i]);

    build(1,1,n);

    for(int i=1;i<=k;i++)
    {
        int type;

        scanf("%i",&type);

        if(type==1)
        {
            make_update();
        }
        else
        {
            solve_query();
        }
    }

    return 0;
}