#include<bits/stdc++.h>
#define int long long
#define M 1000000000
using namespace std;
int n,m,s,w;
int a[200001];
struct yu
{
    int l,r,sum,siz;
}f[10000001];
int tot,x,y;
void ins(int x,int l,int r,int o,int q)
{
    if (l==r)
    {
        f[x].sum+=q*o;
        f[x].siz+=q;
        return;
    }
    int mid=l+r>>1;
    if (mid>=o)
    {
        if (f[x].l==0)f[x].l=++tot;
        ins(f[x].l,l,mid,o,q);
    }
    else 
    {
        if (f[x].r==0)f[x].r=++tot;
        ins(f[x].r,mid+1,r,o,q);
    }
    f[x].sum=f[f[x].l].sum+f[f[x].r].sum;
    f[x].siz=f[f[x].l].siz+f[f[x].r].siz;
}
void find(int x,int l,int r,int s,int o)
{
    if (l==r)
    {
        if (s==0)printf("%lld\n",w-(n-o)+1);
        else
        {
            o+=(s+l-1)/l;
            printf("%lld\n",w-(n-o)+1);
        }
        return;
    }
    int mid=l+r>>1;
    if (f[f[x].l].sum>s)find(f[x].l,l,mid,s,o); else find(f[x].r,mid+1,r,s-f[f[x].l].sum,o+f[f[x].l].siz);
}
signed main()
{
    tot=1;
    scanf("%lld %lld",&n,&m);
    for (int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        if (a[i]<=0)s-=a[i];else ins(1,1,M,a[i],1);
    }
    while (m--)
    {
        scanf("%lld %lld",&x,&y);

        if (a[x]<=0)s+=a[x];else ins(1,1,M,a[x],-1);

        if (y<=0)s-=y;else ins(1,1,M,y,1);
        a[x]=y;

        w=f[1].siz;

        //printf("  %lld %lld\n",s,w);
        if (f[1].sum<=s)printf("%lld\n",f[1].siz+1);else
        find(1,1,M,s,0);
    }
}