#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define endl "\n"

const ll N = 5e6 + 10;
const ll INF = 0x3f3f3f3f3f3f3f;

ll n, m;
ll q;
vector<ll> a(N), tmp(N);
map<ll, ll> mp;
struct node
{
    ll l, r;
    ll cnt;
    ll sum;
} t[N << 2];
#define lu u << 1
#define ru u << 1 | 1

void build(ll u, ll l, ll r)
{
    t[u] = {l, r, 0, 0};
    if (l == r)
        return;
    ll mid = (l + r) >> 1;
    build(lu, l, mid);
    build(ru, mid + 1, r);
}

void upd(ll u, ll pos, ll val)
{
    if (t[u].l == t[u].r)
    {
        t[u].cnt++;
        t[u].sum += val;
        return;
    }
    int mid = (t[u].l + t[u].r) >> 1;
    if (pos <= mid)
        upd(lu, pos, val);
    else
        upd(ru, pos, val);
    t[u].cnt = t[lu].cnt + t[ru].cnt;
    t[u].sum = t[lu].sum + t[ru].sum;
}

void del(ll u, ll pos, ll val)
{
    if (t[u].l == t[u].r)
    {
        t[u].cnt--;
        t[u].sum -= val;
        return;
    }
    int mid = (t[u].l + t[u].r) >> 1;
    if (pos <= mid)
        del(lu, pos, val);
    else
        del(ru, pos, val);
    t[u].cnt = t[lu].cnt + t[ru].cnt;
    t[u].sum = t[lu].sum + t[ru].sum;
}

ll bs(ll u, ll tar)
{
    if (t[u].sum <= tar)
        return t[u].r;
    if (t[u].l == t[u].r)
    {
        if (t[u].sum <= tar)
            return t[u].r;
        return t[u].l - 1;
    }
    if (t[lu].sum >= tar)
        return bs(lu, tar);
    return bs(ru, tar - t[lu].sum);
}

ll ask(ll u, ll l, ll r)
{
    if (t[u].l >= l && t[u].r <= r)
        return t[u].cnt;
    ll mid = (t[u].l + t[u].r) >> 1;
    ll res = 0;
    if (r > mid)
        res += ask(ru, l, r);
    if (l <= mid)
        res += ask(lu, l, r);
    return res;
}
ll askpre(ll u, ll l, ll r)
{
    if (t[u].l >= l && t[u].r <= r)
        return t[u].sum;
    ll mid = (t[u].l + t[u].r) >> 1;
    ll res = 0;
    if (r > mid)
        res += askpre(ru, l, r);
    if (l <= mid)
        res += askpre(lu, l, r);
    return res;
}
void solve()
{
    cin >> n >> q;
    set<ll> st;
    ll fu = 0;
    for (ll i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] < 0)
            fu++;
        if(a[i]==0)continue;
        st.insert(a[i]);
    }
    vector<pll> qry(q + 5);
    for (ll i = 1; i <= q; i++)
    {
        cin >> qry[i].first >> qry[i].second;
        if(qry[i].second)st.insert(qry[i].second);
    }
    int tt = 1;
    for (auto e : st)
    {
        tmp[tt] = e;
        mp[e] = tt++;
    }
    build(1, 1, tt);
    for (ll i = 1; i <= n; i++)
    {
        if(a[i])
            upd(1, mp[a[i]], a[i]);
    }
    for (ll i = 1; i <= q; i++)
    {
        if(a[qry[i].first])del(1, mp[a[qry[i].first]], a[qry[i].first]);
        if(qry[i].second)upd(1, mp[qry[i].second], qry[i].second);
        if (a[qry[i].first] < 0)
            fu--;
        if (qry[i].second < 0)
            fu++;
        a[qry[i].first] = qry[i].second;
        ll pos = bs(1, 0);
        ll pre=askpre(1,1,pos);
        ll ans = ask(1, 1, pos);
        if(pre<0&&pos<tt-1){
            ll qwq=tmp[pos+1];
            ans+=(-pre)/qwq;
        }
        // cout << "pos: " << pos << endl;
        // cout << "cnt: "<<ans<<endl;
        cout << ans - fu + 1 << endl;
    }
}

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