#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define Buff ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//#define int long long

int idx;
struct node
{
    int l, r;
    int ct, lzc;
    ll sm, lz;
} tr[7000000];

map<int, int> Ct;

constexpr int MX = 1000000010;

void update(int l, int r, ll x, int L = 0, int R = MX, int p = 1)
{
    if (x > 0)
        tr[p].ct += (r - l + 1);
    else if (x < 0)
        tr[p].ct -= (r - l + 1);
    tr[p].sm += x * (r - l + 1);
    if (l <= L && R <= r)
    {
        if (x > 0)
            tr[p].lzc++;
        else if (x < 0)
            tr[p].lzc--;
        tr[p].lz += x;
        return;
    }
    int mid = (L + R) >> 1;
    if (l <= mid)
    {
        if (tr[p].l == 0)
            tr[p].l = idx++;
        update(l, min(mid, r), x, L, mid, tr[p].l);
    }
    if (r > mid)
    {
        if (tr[p].r == 0)
            tr[p].r = idx++;
        update(max(l, mid + 1), r, x, mid + 1, R, tr[p].r);
    }
}

int query(int px, int L = 0, int R = MX, int p = 1)
{
    if (L == px && R == px)
        return p;
    int mid = (L + R) >> 1;
    if (tr[p].lz > 0 || tr[p].lzc != 0)
    {
        if (tr[p].l == 0)
            tr[p].l = idx++;
        if (tr[p].r == 0)
            tr[p].r = idx++;

        tr[tr[p].l].sm += tr[p].lz * (mid - L + 1);
        tr[tr[p].r].sm += tr[p].lz * (R - mid);
        tr[tr[p].l].lz += tr[p].lz;
        tr[tr[p].r].lz += tr[p].lz;
        tr[p].lz = 0;

        tr[tr[p].l].ct += tr[p].lzc * (mid - L + 1);
        tr[tr[p].r].ct += tr[p].lzc * (R - mid);
        tr[tr[p].l].lzc += tr[p].lzc;
        tr[tr[p].r].lzc += tr[p].lzc;
        tr[p].lzc = 0;
    }
    if (px <= mid)
    {
        if (tr[p].l == 0)
        {
            return -1;
        }
        return query(px, L, mid, tr[p].l);
    }
    else if (px > mid)
    {
        if (tr[p].r == 0)
        {
            return -1;
        }
        return query(px, mid + 1, R, tr[p].r);
    }
}

ll a[200010];

void solve()
{
    idx = 2;
    int n, q;
    cin >> n >> q;
    ll Sf = 0, Sz = 0, Cz = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] < 0)
            Sf += a[i];
        else if (a[i] > 0)
        {
            Cz++;
            Sz += a[i];
            Ct[a[i]]++;
            update(a[i], MX, a[i]);
        }
    }

    while (q--)
    {
        int p;
        ll x;
        cin >> p >> x;

        if (a[p] < 0)
        {
            Sf -= a[p];
        }
        else if (a[p] > 0)
        {
            Cz--;
            Sz -= a[p];
            Ct[a[p]]--;
            update(a[p], MX, -a[p]);
        }
        a[p] = x;

        if (x <= 0)
            Sf += x;
        else if (x > 0)
        {
            Cz++;
            Sz += x;
            Ct[x]++;
            update(x, MX, x);
        }

        if (Sf == 0)
        {
            cout << "1\n";
            continue;
        }
        if (Sz + Sf <= 0)
        {
            cout << Cz + 1 << '\n';
            continue;
        }

        auto check = [&](int px) -> bool
        {
            int qy = query(px);
            if (qy == -1)
            {
                if (Sf == 0)
                    return true;
                else
                    return false;
            }
            if (Sf + tr[qy].sm >= 0)
                return true;
            else
                return false;
        };

        int l = 0, r = MX;
        while (l < r)
        {
            int mid = (l + r) >> 1;
            if (check(mid))
                r = mid;
            else
                l = mid + 1;
        }
        int qy = query(l);
        int mxc = tr[qy].ct;
        ll ca = tr[qy].sm + Sf;
        int cty = Ct[l];
        while (cty-- && ca > 0)
        {
            ca -= l;
            mxc--;
        }
        int ans = mxc + 1;
        cout << ans << '\n';
    }
}

signed main()
{
#ifdef YGYYYGJ
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    Buff;
    int _T_ = 1;
    while (_T_--)
    {
        solve();
    }
    return 0;
}