# include <bits/stdc++.h>
using namespace std;
const long long maxn = 8e5+5;
long long a[maxn];
struct Segment
{
    long long tek[maxn],fromlazy[maxn],inv[maxn];
    bool lazy[maxn];
    void init(long long v, long long from, long long to)
    {
        fromlazy[v] = 0;
        inv[v] = 1;
        lazy[v] = 0;
        if(from==to)
        {

            tek[v] = a[from];
            return;
        }
        long long mid = (from+to)/2;
        init(2*v,from,mid);
        init(2*v+1,mid+1,to);

       tek[v] = tek[2*v]+tek[2*v+1];
    }
    void update_lazy(long long v, long long from, long long to)
    {
        if(!lazy[v])return ;
       // cout<<"update_lazy : "<<v<<" "<<from<<" "<<to<<" : "<<fromlazy[v]<<" "<<inv[v]<<" "<<tek[v]<<endl;
        if(from!=to)
        {
            lazy[2*v] =lazy[2*v+1]=1;
           fromlazy[2*v] = fromlazy[v] + inv[v]*fromlazy[2*v];
           fromlazy[2*v+1] = fromlazy[v] + inv[v]*fromlazy[2*v+1];
           inv[2*v] = inv[2*v]*inv[v];
           inv[2*v+1] = inv[2*v+1]*inv[v];
        }
        tek[v] = fromlazy[v]*(to-from+1) +inv[v]*tek[v];
        inv[v] = 1;
        fromlazy[v] = 0;
        lazy[v]  =0;
                return ;
    }
    void update(long long v, long long from, long long to, long long l, long long r, long long x)
    {
        update_lazy(v,from,to);
        if(l<=from&&to<=r)
        {
           fromlazy[v] = x-fromlazy[v];
           lazy[v]  = 1;
           inv[v] *= -1;

            update_lazy(v,from,to);
            return ;
        }
        long long mid = (from+to)/2;
        update_lazy(2*v,from,mid);
        update_lazy(2*v+1,mid+1,to);
        if(l<=mid)update(2*v,from,mid,l,r,x);
        if(r>mid)update(2*v+1,mid+1,to,l,r,x);
        tek[v] = tek[2*v]+tek[2*v+1];
    }
    long long query(long long v,long long from, long long to, long long l, long long r)
    {
        update_lazy(v,from,to);
       // cout<<v<<" "<<from<<" "<<to<<" "<<l<<" "<<r<<" "<<tek[v]<<endl;
        if(l<=from&&to<=r)
            return tek[v];
        long long ans = 0;
        long long mid = (from+to)/2;
        if(l<=mid)ans+=query(2*v,from,mid,l,r);
        if(r>mid)ans+=query(2*v+1,mid+1,to,l,r);
        return ans;
    }

};
Segment S;
int L[maxn];
void upd(int from, int to, int k)
{
    int i;
    for(i=from;i<=to;i++)
        L[i] = k-L[i];
}
int qu(int from, int to)
{
        int i,sum=0;
    for(i=from;i<=to;i++)
      sum+=L[i];
      return sum;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
freopen("accounting.in","r",stdin);
freopen("accounting.out","w",stdout);
long long n,q;
cin>>n>>q;
long long i,j,u,v,t;
char ch;
for(i = 1;i<=n;i++){cin>>a[i];L[i]=a[i];}
S.init(1,1,n);
for(i=1;i<=q;i++)
{
    cin>>ch>>u>>v;
    if(ch=='-')
    {
        cin>>t;
        S.update(1,1,n,u,v,t);
       // upd(u,v,t);
    }
    else
    {
        cout<<S.query(1,1,n,u,v)<<endl;//<<" "<<qu(u,v)<<endl;
    }
   // cout<<" **** ";
   // for(j = 1; j<=n;j++)
   //     cout<<L[j]<<" ";
  //  cout<<endl;
}
return 0;
}