#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define ls rt<<1
#define rs rt<<1|1
using namespace std;
const int MAXN=2e5+5;
struct SegmentTree{
    int l,r,sum,num;
}tr[MAXN];
void update(int rt)
{
    tr[rt].sum=tr[ls].sum+tr[rs].sum;
    tr[rt].num=tr[ls].num+tr[rs].num;
}
void build(int l,int r,int rt)
{
    tr[rt].l=l,tr[rt].r=r;
    if(l==r) return;
    int mid=l+r>>1;
    build(l,mid,ls);
    build(mid+1,r,rs);
    update(rt);
}
void modify(int pos,int rt,int c)
{
    if(tr[rt].l==tr[rt].r)
    {
        tr[rt].sum+=c;
        if(c>0) tr[rt].num++;
        else tr[rt].num--;
        return;
    }
    int mid=tr[rt].l+tr[rt].r>>1;
    if(pos<=mid) modify(pos,ls,c);
    else modify(pos,rs,c);
    update(rt);
}
int query(int l,int r,int rt,int sum)
{
    if(l==r)
    {
        if(tr[rt].sum>sum) return 0;
        else return tr[rt].num;
    }
    int mid=l+r>>1;
    if(tr[rt].sum>=sum) return query(l,mid,ls,sum);
    else return tr[ls].num+query(mid+1,r,rs,sum-tr[ls].sum);
}
void solve()
{
    int n,q;
    cin>>n>>q;
    vector<int> a(n+1),X;
    vector<pair<int,int>> ask(q+1);
    for(int i=1;i<=n;i++) 
    {
        cin>>a[i];
        if(a[i]>0) X.push_back(a[i]);
    }
    for(int i=1;i<=q;i++)
    {
        cin>>ask[i].first>>ask[i].second;
        if(ask[i].second>0) X.push_back(ask[i].second);
    }
    sort(X.begin(),X.end());
    X.erase(unique(X.begin(),X.end()),X.end());
    int len=X.size();
    if(len==0) {cout<<1<<endl;return;}
    build(1,len,1);
    int tot=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]>0)
        {
            int pos=lower_bound(X.begin(),X.end(),a[i])-X.begin()+1;
            modify(pos,1,a[i]);
        }
        else tot-=a[i];
    }
    for(int i=1;i<=q;i++)
    {
        int now=ask[i].first;
        if(a[now]<=0) tot+=a[now];
        else
        {
            int pos=lower_bound(X.begin(),X.end(),a[now])-X.begin()+1;
            modify(pos,1,-a[now]);
        }
        a[now]=ask[i].second;
        if(a[now]<=0) tot-=a[now];
        else
        {
            int pos=lower_bound(X.begin(),X.end(),a[now])-X.begin()+1;
            modify(pos,1,a[now]);
        }
        cout<<query(1,len,1,tot)+1<<endl;
    }
}
signed main()
{  
    cin.tie(0)->sync_with_stdio(0);
    int t=1;
    while(t--) solve();
    return 0;
}