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

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=1<<19;

template<int(*op)(int,int),int(*e)()>
struct segtree{
    int val[N<<1];
    segtree(){for(int i=0; i<(N<<1); ++i) val[i]=e();}
    void set(int p, int x){
        p+=N;
        val[p]=x;
        for(p>>=1; p; p>>=1) val[p]=op(val[p<<1],val[p<<1|1]);
    }
    int query(int l, int r){
        if(l>r) return e();
        int res=e();
        l+=N,r+=N;
        while(l<r){
            if(l%2) res=op(res,val[l]),l++;
            if(r%2==0) res=op(res,val[r]),r--;
            l>>=1,r>>=1;
        }
        if(l==r) res=op(res,val[l]);
        return res;
    }
};

int n,q,a[N],l[N],r[N];

int op_max(int x, int y){return max(x,y);}
int e_max(){return -1e9;}
int op_min(int x, int y){return min(x,y);}
int e_min(){return 1e9;}

segtree<op_max,e_max> tree_max;
segtree<op_min,e_min> tree_min;

void ahcorz(){
    cin >> n >> q;
    for(int i=0; i<n; ++i) cin >> a[i];
    ll res=0;
    vector<int> stk={-1};
    for(int i=0; i<n; ++i){
        while(stk.back()>=0&&a[i]>a[stk.back()]) stk.pop_back();
        l[i]=stk.back();
        stk.pb(i);
    }
    stk={n};
    for(int i=n-1; i>=0; --i){
        while(stk.back()<n&&a[i]>=a[stk.back()]) stk.pop_back();
        r[i]=stk.back();
        stk.pb(i);
    }
    for(int i=0; i<n; ++i) res+=1ll*a[i]*(i-l[i])*(r[i]-i);
    stk={-1};
    for(int i=0; i<n; ++i){
        while(stk.back()>=0&&a[i]<a[stk.back()]) stk.pop_back();
        l[i]=stk.back();
        stk.pb(i);
    }
    stk={n};
    for(int i=n-1; i>=0; --i){
        while(stk.back()<n&&a[i]<=a[stk.back()]) stk.pop_back();
        r[i]=stk.back();
        stk.pb(i);
    }
    for(int i=0; i<n; ++i) res-=1ll*a[i]*(i-l[i])*(r[i]-i);
    for(int i=0; i<n; ++i) tree_max.set(i,a[i]),tree_min.set(i,a[i]);
    //cout << res << "\n";
    while(q--){
        char c; int p; cin >> c >> p; p--;
        //for(int i=0; i<n; ++i) cout << a[i] << ' ';
        //cout << '\n';
        if(c=='+'){
            int L=p,R=p,L2=p,R2=p;
            if(p>0&&a[p-1]<=a[p]){
                int ok=p,ng=-1;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_max.query(mid,p)==a[p]) ok=mid;
                    else ng=mid;
                }
                L=ok;
            }
            else{
                int ok=p,ng=-1;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_min.query(mid,p-1)>a[p]) ok=mid;
                    else ng=mid;
                }
                L2=ok;
            }
            if(p+1<n&&a[p+1]<=a[p]){
                int ok=p,ng=n;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_max.query(p,mid)==a[p]) ok=mid;
                    else ng=mid;
                }
                R=ok;
            }
            else{
                int ok=p,ng=n;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_min.query(p+1,mid)>a[p]) ok=mid;
                    else ng=mid;
                }
                R2=ok;
            }
            //cout << L << ' ' << R << ' ' << L2 << ' ' << R2 << "\n";
            res+=1ll*(p-L+1)*(R-p+1);
            res-=1ll*(p-L2+1)*(R2-p+1);
            a[p]++;
        }
        else{
            int L=p,R=p,L2=p,R2=p;
            if(p>0&&a[p-1]>=a[p]){
                int ok=p,ng=-1;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_min.query(mid,p)==a[p]) ok=mid;
                    else ng=mid;
                }
                L=ok;
            }
            else{
                int ok=p,ng=-1;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_max.query(mid,p-1)<a[p]) ok=mid;
                    else ng=mid;
                }
                L2=ok;
            }
            if(p+1<n&&a[p+1]>=a[p]){
                int ok=p,ng=n;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_min.query(p,mid)==a[p]) ok=mid;
                    else ng=mid;
                }
                R=ok;
            }
            else{
                int ok=p,ng=n;
                while(abs(ok-ng)>1){
                    int mid=ok+ng>>1;
                    if(tree_max.query(p+1,mid)<a[p]) ok=mid;
                    else ng=mid;
                }
                R2=ok;
            }
            //cout << L << ' ' << R << ' ' << L2 << ' ' << R2 << "\n";
            res+=1ll*(p-L+1)*(R-p+1);
            res-=1ll*(p-L2+1)*(R2-p+1);
            a[p]--;
        }
        tree_max.set(p,a[p]),tree_min.set(p,a[p]);
        cout << res << "\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t=1; //cin >> t;
    while(t--) ahcorz();
}