#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define F first
#define S second
typedef tree<
int,
null_type,
less_equal<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ordered_set s;
int n,q;
int a[200005];	   
int sum;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(NULL);
	cin>>n>>q;
	for(int i=1; i<=n; i++){
		cin>>a[i];
		if(a[i]<0){
			sum+=a[i];
		}
		else if(a[i]>0){
			s.insert(a[i]);
		}
	}
	while(q--){
		int idx, val;
		cin>>idx>>val;
		if(a[idx]<0){
			sum-=a[idx];
		}
		else if(a[idx]>0){
			s.erase(s.upper_bound(a[idx]));
//			s.insert(val);
		}
		
		if(val>0){
			s.insert(val);
		}else if(val<0){
			sum+=val;
		}
//		cout<<"SUM"<<sum<<endl;
		cout<<s.order_of_key(-sum)+1<<endl;
		a[idx]=val;
	}
}