#include<stdio.h>

 #include<algorithm>

 #include<string.h>

 #include<stdlib.h>

 #include<math.h>

 //#include<bitset>

 //#include<iostream>

 using namespace std;

 int n,m,q;

 #define maxn 100011

 #define maxm 361

 #define LL long long

 const LL inf=1e18;

 LL a[maxn],add[maxm],be[maxm],sum[maxm],Max[maxm],Min[maxm]; bool hasbe[maxm];

 int bel[maxn],tot;

 void down(int x)

 {

     int l=(x-)*m+,r=min(x*m,n);

     for (int i=l;i<=r;i++)

     {

         if (add[x]) a[i]+=add[x];

         else if (hasbe[x]) a[i]=be[x];

     }

     add[x]=hasbe[x]=;

 }

 void up(int x)

 {

     int l=(x-)*m+,r=min(x*m,n);

     sum[x]=; Max[x]=-inf; Min[x]=inf;

     for (int i=l;i<=r;i++)

         sum[x]+=a[i],Max[x]=max(Max[x],a[i]),Min[x]=min(Min[x],a[i]);

 }

 void Addsingle(int x,int y,int v)

 {

     down(bel[x]);

     for (int i=x;i<=y;i++) a[i]+=v;

     up(bel[x]);

 }

 void Add(int x,int y,int v)

 {

     if (bel[x]==bel[y]) Addsingle(x,y,v);

     else

     {

         int j;

         for (j=x;bel[j]==bel[x];j++);

         Addsingle(x,j-,v);

         for (j=y;bel[j]==bel[y];j--);

         Addsingle(j+,y,v);

         for (int i=bel[x]+;i<bel[y];i++)

         {

             if (hasbe[i]) be[i]+=v;

             else add[i]+=v;

             sum[i]+=1ll*m*v;

             Max[i]+=v; Min[i]+=v;

         }

     }

 }

 void Besingle(int x,int y,int v)

 {

     down(bel[x]);

     for (int i=x;i<=y;i++) a[i]=v;

     up(bel[x]);

 }

 void Be(int x,int y,int v)

 {

     if (bel[x]==bel[y]) Besingle(x,y,v);

     else

     {

         int j;

         for (j=x;bel[j]==bel[x];j++);

         Besingle(x,j-,v);

         for (j=y;bel[j]==bel[y];j--);

         Besingle(j+,y,v);

         for (int i=bel[x]+;i<bel[y];i++)

         {

             if (add[i]) add[i]=;

             hasbe[i]=; be[i]=v;

             sum[i]=1ll*m*v;

             Max[i]=Min[i]=v;

         }

     }

 }

 LL qsumsingle(int x,int y)

 {

     LL ans=;

     for (int i=x;i<=y;i++)

     {

         if (hasbe[bel[i]]) ans+=be[bel[i]];

         else ans+=a[i]+add[bel[i]];

     }

     return ans;

 }

 LL qsum(int x,int y)

 {

     if (bel[x]==bel[y]) return qsumsingle(x,y);

     else

     {

         int j;

         for (j=x;bel[j]==bel[x];j++);

         LL ans=qsumsingle(x,j-);

         for (j=y;bel[j]==bel[y];j--);

         ans+=qsumsingle(j+,y);

         for (int i=bel[x]+;i<bel[y];i++) ans+=sum[i];

         return ans;

     }

 }

 LL qmaxsingle(int x,int y)

 {

     LL ans=-inf;

     for (int i=x;i<=y;i++)

     {

         if (hasbe[bel[i]]) ans=max(ans,be[bel[i]]);

         else ans=max(ans,a[i]+add[bel[i]]);

     }

     return ans;

 }

 LL qmax(int x,int y)

 {

     if (bel[x]==bel[y]) return qmaxsingle(x,y);

     else

     {

         int j;

         for (j=x;bel[j]==bel[x];j++);

         LL ans=qmaxsingle(x,j-);

         for (j=y;bel[j]==bel[y];j--);

         ans=max(ans,qmaxsingle(j+,y));

         for (int i=bel[x]+;i<bel[y];i++) ans=max(ans,Max[i]);

         return ans;

     }

 }

 LL qminsingle(int x,int y)

 {

     LL ans=inf;

     for (int i=x;i<=y;i++)

     {

         if (hasbe[bel[i]]) ans=min(ans,be[bel[i]]);

         else ans=min(ans,a[i]+add[bel[i]]);

     }

     return ans;

 }

 LL qmin(int x,int y)

 {

     if (bel[x]==bel[y]) return qminsingle(x,y);

     else

     {

         int j;

         for (j=x;bel[j]==bel[x];j++);

         LL ans=qminsingle(x,j-);

         for (j=y;bel[j]==bel[y];j--);

         ans=min(ans,qminsingle(j+,y));

         for (int i=bel[x]+;i<bel[y];i++) ans=min(ans,Min[i]);

         return ans;

     }

 }

 int main()

 {

     scanf("%d%d",&n,&q);

     m=(int)sqrt(n);

     for (int i=;i<=n;i++) bel[i]=(i-)/m+;

     tot=bel[n];

     for (int i=;i<=tot;i++) Max[i]=-inf,Min[i]=inf;

     for (int i=;i<=n;i++)

     {

         scanf("%lld",&a[i]);

         sum[bel[i]]+=a[i];

         Max[bel[i]]=max(Max[bel[i]],a[i]);

         Min[bel[i]]=min(Min[bel[i]],a[i]);

     }

     char c[];int x,y,z;

     while (q--)

     {

         scanf("%s%d%d",c,&x,&y);

         if (c[]=='a') scanf("%d",&z),Add(x,y,z);

         else if (c[]=='e') scanf("%d",&z),Be(x,y,z);

         else if (c[]=='u') printf("%lld\n",qsum(x,y));

         else if (c[]=='a') printf("%lld\n",qmax(x,y));

         else printf("%lld\n",qmin(x,y));

     }

     return ;

 }