#include <bits/stdc++.h>
using namespace std;
#define int long long

using LL = long long;

const int N = 201000;

int n, m, Q;   
int ans;
struct node{
    int l, r;
    LL sum, cnt;
}tr[N * 60]; 
int rt, idx;
int a[N];

void push_up(int u){
    tr[u].sum = tr[tr[u].l].sum + tr[tr[u].r].sum;
    tr[u].cnt = tr[tr[u].l].cnt + tr[tr[u].r].cnt;
}

void modify(int &u, int l, int r, int pos, int x){
    if(!u) u = ++ idx;
    if(l == r){
        tr[u].cnt += x;
        tr[u].sum += pos * x;
        return; 
    }
    int mid = l + r >> 1;
    if(pos <= mid) modify(tr[u].l, l, mid, pos, x);
    else modify(tr[u].r, mid + 1, r, pos, x);   
    push_up(u);
}

int query(int u, int l, int r, LL tot){
    if(!u) return 0; 
    if(l == r){
        return min(tot / r, tr[u].cnt);
    }
    int mid = l + r >> 1;
    if(tot >= tr[u].sum){
        return tr[u].cnt + query(tr[u].r, mid + 1, r, tot - tr[u].sum);
    }
    return query(tr[u].l, l, mid, tot);
}

void solve() {

    cin >> n >> Q;
    
    for(int i = 1; i <= n; i ++) cin >> a[i];
    
    LL totf = 0;
    int nx = 1e9;

    for(int i = 1; i <= n; i ++){
        if(a[i] <= 0) totf += - a[i];
        else{
            modify(rt, 1, nx, a[i], 1);
        }
    }

    while(Q --){
        int pos, x;
        cin >> pos >> x;
        if(a[pos] > 0) modify(rt, 1, nx, a[pos], -1);
        else totf += a[pos];

        if(x > 0) modify(rt, 1, nx, x, 1);
        else totf -= x;
        a[pos] = x;
        cout << query(rt, 1, nx, totf) + 1 << "\n";
    }

}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    //cin >> _;
    while(_--) {
        solve();
    }
}

/*

3 5
1 2 3
3 4
2-2
1-3
3 1
2 1
*/