#include<bits/stdc++.h>
using namespace std;
constexpr int N=500005;
int n,q;
int a[N];
struct Segment_Tree
{
    #define ls i*2
    #define rs i*2+1
    struct Node
    {
        int l,r;
        int mn,mx;
    }tree[N*4];
    void push_up(int i)
    {
        tree[i].mn=min(tree[ls].mn,tree[rs].mn);
        tree[i].mx=max(tree[ls].mx,tree[rs].mx);
        return;
    }
    void build(int i,int l,int r)
    {
        tree[i].l=l,tree[i].r=r;
        if(l==r)
        {
            tree[i].mx=tree[i].mn=a[l];
            return;
        }
        int mid=(l+r)>>1;
        build(ls,l,mid);
        build(rs,mid+1,r);
        push_up(i);
        return;
    }
    void add(int i,int u,int v)
    {
        if(tree[i].l==tree[i].r)
        {
            tree[i].mx+=v;
            tree[i].mn+=v;
            return;
        }
        if(u<=tree[ls].r) add(ls,u,v);
        else add(rs,u,v);
        push_up(i);
        return;
    }
    int query_prefix_less(int i,int u,int x)
    {
        if(u<1) return 0;
        if(tree[i].mn>x) return tree[i].l-1;
        if(tree[i].l==tree[i].r) return tree[i].l;
        if(u<=tree[ls].r) return query_prefix_less(ls,u,x);
        if(tree[rs].mn>x) return query_prefix_less(ls,u,x);
        int p=query_prefix_less(rs,u,x);
        if(p!=tree[rs].l-1) return p;
        return query_prefix_less(ls,u,x);
    }
    int query_suffix_less(int i,int u,int x)
    {
        if(u>n) return n+1;
        if(tree[i].mn>x) return tree[i].r+1;
        if(tree[i].l==tree[i].r) return tree[i].r;
        if(u>=tree[rs].l) return query_suffix_less(rs,u,x);
        if(tree[ls].mn>x) return query_suffix_less(rs,u,x);
        int p=query_suffix_less(ls,u,x);
        if(p!=tree[ls].r+1) return p;
        return query_suffix_less(rs,u,x);
    }
    int query_prefix_greater(int i,int u,int x)
    {
        if(u<1) return 0;
        if(tree[i].mx<x) return tree[i].l-1;
        if(tree[i].l==tree[i].r) return tree[i].l;
        if(u<=tree[ls].r) return query_prefix_greater(ls,u,x);
        if(tree[rs].mx<x) return query_prefix_greater(ls,u,x);
        int p=query_prefix_greater(rs,u,x);
        if(p!=tree[rs].l-1) return p;
        return query_prefix_greater(ls,u,x);
    }
    int query_suffix_greater(int i,int u,int x)
    {
        if(u>n) return n+1;
        if(tree[i].mx<x) return tree[i].r+1;
        if(tree[i].l==tree[i].r) return tree[i].r;
        if(u>=tree[rs].l) return query_suffix_greater(rs,u,x);
        if(tree[ls].mx<x) return query_suffix_greater(rs,u,x);
        int p=query_suffix_greater(ls,u,x);
        if(p!=tree[ls].r+1) return p;
        return query_suffix_greater(rs,u,x);
    }
    #undef ls
    #undef rs
}T;
int pre[N],suf[N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    stack<int>s;
    for(int i=1;i<=n;i++)
    {
        while(!s.empty()&&a[s.top()]<a[i]) s.pop();
        if(s.empty()) pre[i]=0;
        else pre[i]=s.top();
        s.emplace(i);
    }
    while(!s.empty())
        s.pop();
    for(int i=n;i>=1;i--)
    {
        while(!s.empty()&&a[s.top()]<=a[i]) s.pop();
        if(s.empty()) suf[i]=n+1;
        else suf[i]=s.top();
        s.emplace(i);
    }
    long long mx=0;
    for(int i=1;i<=n;i++)
        mx+=(long long)(i-pre[i])*(suf[i]-i)*a[i];
    while(!s.empty())
        s.pop();
    for(int i=1;i<=n;i++)
    {
        while(!s.empty()&&a[s.top()]>a[i]) s.pop();
        if(s.empty()) pre[i]=0;
        else pre[i]=s.top();
        s.emplace(i);
    }
    while(!s.empty())
        s.pop();
    for(int i=n;i>=1;i--)
    {
        while(!s.empty()&&a[s.top()]>=a[i]) s.pop();
        if(s.empty()) suf[i]=n+1;
        else suf[i]=s.top();
        s.emplace(i);
    }
    long long mn=0;
    for(int i=1;i<=n;i++)
        mn+=(long long)(i-pre[i])*(suf[i]-i)*a[i];
    T.build(1,1,n);
    while(q--)
    {
        char op;
        int p;
        cin>>op>>p;
        if(op=='-')
        {
            int ll=T.query_prefix_greater(1,p-1,a[p]),rr=T.query_suffix_greater(1,p+1,a[p]);
            mx-=(long long)(p-ll)*(rr-p);
            ll=T.query_prefix_less(1,p-1,a[p]-1),rr=T.query_suffix_less(1,p+1,a[p]-1);
            mn-=(long long)(p-ll)*(rr-p);
            a[p]--;
            T.add(1,p,-1);
        }
        else if(op=='+')
        {
            int ll=T.query_prefix_greater(1,p-1,a[p]+1),rr=T.query_suffix_greater(1,p+1,a[p]+1);
            mx+=(long long)(p-ll)*(rr-p);
            ll=T.query_prefix_less(1,p-1,a[p]),rr=T.query_suffix_less(1,p+1,a[p]);
            mn+=(long long)(p-ll)*(rr-p);
            a[p]++;
            T.add(1,p,1);
        }
        long long ans=mx-mn;
        cout<<ans<<"\n";
    }
    return 0;
}