找不到错哪了

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,k;
struct node
{
    ll l,r,data;
    ll num;    
}tree[9999901];
ll input[9999001];
void build(ll l,ll r,ll index,ll input[])
{
    tree[index].num=0;
    tree[index].l=l;
    tree[index].r=r;
    if(l==r)
    {
        tree[index].data=input[l];
        return ;
    }
    ll mid=(l+r)/2;
    build(l,mid,index*2,input);
    build(mid+1,r,index*2+1,input);
    tree[index].data=tree[index*2].data+tree[index*2+1].data;
    return ;
}
void push_down(ll index)
{
    if(tree[index].num!=0)
    {
        tree[index*2].num+=tree[index].num;
        tree[index*2+1].num+=tree[index].num;
        ll mid=(tree[index].l+tree[index].r)/2;
        tree[index*2].data+=tree[index].num*(mid-tree[index*2].l+1);
        tree[index*2+1].data+=tree[index].num*(tree[index*2+1].r-mid);
        tree[index].num=0;
    }
    return ;
}
void my_plu(ll index,ll l,ll r,ll k)
{
    if(tree[index].r<=r && tree[index].l>=l)
    {
        tree[index].data*=k*(tree[index].r-tree[index].l+1);
        tree[index].num+=k;
        return ;
    }
    push_down(index);
    if(tree[index*2].r>=l)
        my_plu(index*2,l,r,k);
    if(tree[index*2+1].l<=r)
        my_plu(index*2+1,l,r,k);
    tree[index].data=tree[index*2].data+tree[index*2+1].data;
    return ;
}
void up_data(ll index,ll l,ll r,ll k)
{
    if(tree[index].r<=r && tree[index].l>=l)
    {
        tree[index].data+=k*(tree[index].r-tree[index].l+1);
        tree[index].num+=k;
        return ;
    }
    push_down(index);
    if(tree[index*2].r>=l)
        up_data(index*2,l,r,k);
    if(tree[index*2+1].l<=r)
        up_data(index*2+1,l,r,k);
    tree[index].data=tree[index*2].data+tree[index*2+1].data;
    return ;
}
ll search(ll index,ll l,ll r)
{
    if(tree[index].l>=l && tree[index].r<=r)
        return tree[index].data;
    push_down(index);
    ll num=0;
    if(tree[index*2].r>=l)
        num+=search(index*2,l,r);
    if(tree[index*2+1].l<=r)
        num+=search(index*2+1,l,r);
    return num;
}
int main()
{
    cin>>n>>m>>k;
    for(ll i=1;i<=n;i++) cin>>input[i];
    build(1,n,1,input);
    for(ll i=1;i<=m;i++)
    {
        ll a,b,c;
        cin>>a>>b>>c;
        if (a==1)
        {
        	ll x;
        	cin>>x;
        	my_plu(1,b,c,x);
		}
        if(a==2)
        {
            ll x;
            cin>>x;
            up_data(1,b,c,x);
        }
        if(a==3)
        {
            printf("%lld\n",search(1,b,c)%k);
        }
    }
    return 0;
}