//ram
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int long long
#define pii pair<int,int>
#define fs first
#define sc second
#define pb push_back
const int N=5.1e5;
int c[N][2],sz[N],f[N],cnt[N],val[N],top=1;
int sum[N];
#define lc c[x][0]
#define rc c[x][1]
void pushup(int x){
	sum[x]=sum[lc]+sum[rc]+val[x]*cnt[x];
	sz[x]=sz[lc]+sz[rc]+cnt[x];
}
void ro(int x){
	if(!f[x])return;
	int p=f[x],g=f[p];
	if(g)c[g][c[g][1]==p]=x;
	f[x]=g,f[p]=x;
	if(x==c[p][0])f[rc]=p,c[p][0]=rc,rc=p;
	else f[lc]=p,c[p][1]=lc,lc=p;
	f[0]=0,pushup(p),pushup(x);
}
void splay(int x){
	while(f[x]){
		int p=f[x];
		if(f[f[p]]){
			if((c[p][0]==x)^(c[f[p]][0]==p))ro(x);
			else ro(p);
		}ro(x);
	}
}
int insert(int v,int x) {
	if(val[x]==v)return cnt[x]++,x;
	int t=val[x]<v;
	if(!c[x][t])c[x][t]=++top,f[top]=x,val[top]=v;
	int r=insert(v,c[x][t]);
	return pushup(x),r;
}
int kth(int k,int x){
	if(!x)return 1;
	if(k<=sz[lc])return kth(k,lc);
	if(k<=sz[lc]+cnt[x])return x;
	return kth(k-sz[lc]-cnt[x],rc);
}
int rnk(int v,int x){//if val v is not in tree , return rnk(nxt(v)) 
	if(!x)return 1;
	if(val[x]==v)return sz[lc]+1;
	return rnk(v,c[x][v>val[x]])+(v>val[x])*(sz[lc]+cnt[x]);
}
int pre(int v){return splay(1),kth(rnk(v,1)-1,1);}
int nxt(int v){return splay(1),kth(rnk(v+1,1),1);}
void erase(int v){
	splay(1);
	int l=pre(v),r=nxt(v);
	splay(l),splay(r);
	if(cnt[c[l][1]]>1)cnt[c[l][1]]--;
	else f[c[l][1]]=0,c[l][1]=0;
	pushup(c[l][1]),pushup(l),pushup(r);
}
int search(int ee,int x){
	if(!x)return 0;//?
	if(ee<=sum[rc])return search(ee,rc);
	else if(ee<=sum[rc]+val[x]*cnt[x]){
        int cc=(ee-sum[rc])/val[x]+((ee-sum[rc])%val[x]!=0);
        return sz[rc]+cc;
    }
    return sz[rc]+cnt[x]+search(ee-sum[rc]-val[x]*cnt[x],lc);
}
void print(int x){
	if(!x)return;
	cout<<x<<": val="<<val[x]<<" lc="<<lc<<" rc="<<rc<<" cnt="<<cnt[x]<<" sum="<<sum[x]<<"\n";
	print(lc),print(rc);
}
int ar[N];
signed main(){
    //freopen("a.txt","r",stdin);
	sz[1]=1,cnt[1]=1,val[1]=-2e9;
	insert(2e9,1);
	int n,q;
	scanf("%lld%lld",&n,&q);
	int SUM=0;
	for(int i=1;i<=n;i++){
		scanf("%lld",ar+i);
		splay(1);
		if(ar[i]>0)splay(insert(ar[i],1));
		SUM+=ar[i];
	}
	splay(1);
	//print(1);
	
	for(int i=1;i<=q;i++){
		int o,u;
		scanf("%lld%lld",&o,&u);
		if(ar[o]>0)erase(ar[o]);
		if(u>0)splay(1),splay(insert(u,1));
		SUM-=ar[o],SUM+=u;
		splay(1);
		int t=search(max(SUM,1LL)+2e9,1);
		//cerr<<t<<" "<<sz[1]<<"@\n";
		t=(sz[1]-2)-(t-1)   +1;
		if(SUM<=0)t++;
		cout<<t<<"\n";
		
		ar[o]=u;
		
		/*
		if(op==1)splay(insert(e,1));
		if(op==2)erase(e);
		if(op==3)ans=rnk(e,1)-1,splay(kth(ans+1,1));
		if(op==4)ans=kth(e+1,1),splay(ans),ans=val[ans];
		if(op==5)ans=pre(e),splay(ans),ans=val[ans];
		if(op==6)ans=nxt(e),splay(ans),ans=val[ans];
		if(op>=3&&op<=6)printf("%d\n",ans);
		*/
	}
	return 0;
}