#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
const int N = 2e5 + 5, M = 1e4 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f3f3f3f3f;
int n, q;
int a[N], x[N], v[N];
map<int, int>mp, idx, idxinv; //离散化
struct BIT
{
    const static int maxnum = 5e5 + 10;
    int tree[maxnum];
    int lowbit(int x)
    {
        return (x) & (-x);
    }
    void add(int idx, int x)
    {
        for (int pos = idx; pos < maxnum; pos += lowbit(pos))
        {
            tree[pos] += x;
        }
    }
    int query(int n)
    {
        int ans = 0;
        for (int pos = n; pos; pos -= lowbit(pos))
        {
            ans += tree[pos];
        }
        return ans;
    }
    int query(int a, int b)
    {
        return query(b) - query(a - 1);
    }
    void init(int n)
    {
        for (int i = 0; i <= n + 2; i++)
            tree[i] = 0;
    }
} tree, tree2;
void solve()
{
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] > 0) mp[a[i]]++;
    }
    // bool ok = false;
    // if (a[2] == 1)
    // {
    //     ok = true;
    // }
    for (int i = 1; i <= q; i++)
    {
        cin >> x[i] >> v[i];
        if (v[i] > 0) mp[v[i]]++;
    }
    int cnt = 0;
    for (auto mpp : mp)
    {
        cnt++;
        idx[mpp.first] = cnt;
        idxinv[cnt] = mpp.first;
    }

    int sum = 0;//负数的绝对值的和
    int res = 0;//正数的和
    for (int i = 1; i <= n; i++)
    {
        if (a[i] < 0) sum -= a[i];
        if (a[i] > 0)
        {
            res += a[i];
            int val = idx[a[i]];
            tree.add(val, 1);
            tree2.add(val, a[i]);
        }
    }
    for (int i = 1; i <= q; i++)
    {
        if (v[i] < 0)
        {
            sum -= v[i];
            if (a[x[i]] < 0)
            {
                sum += a[x[i]];
            }
            else if (a[x[i]] > 0)
            {
                res -= a[x[i]];
                int val = idx[a[x[i]]];
                tree.add(val, -1);
                tree2.add(val, -a[x[i]]);
            }
            a[x[i]] = v[i];
        }
        else if (v[i] > 0)
        {
            res += v[i];
            if (a[x[i]] < 0)
            {
                sum += a[x[i]];
            }
            else if (a[x[i]] > 0)
            {
                res -= a[x[i]];
                int val = idx[a[x[i]]];
                tree.add(val, -1);
                tree2.add(val, -a[x[i]]);
            }
            tree.add(idx[v[i]], 1);
            tree2.add(idx[v[i]], v[i]);
            a[x[i]] = v[i];
        }
        // cout << "sum = " << sum << endl;
        int low = 1, high = cnt;
        while (low < high)
        {
            int mid = low + high >> 1;
            if (tree2.query(mid) > sum)
            {
                high = mid;
            }
            else low = mid + 1;
        }
        low--;
        // cout << "low = " << low << endl;
        int num = tree.query(low);//数量
        int ans = tree2.query(low);//值
        // cout << "ans = " << ans << endl;
        if (ans < sum)
        {
            int val = idxinv[low + 1];
            // cout << "val = " << val << endl;

            // cout << "num = " << tree.query(low + 1, low + 1) << endl;
            int kkksc = 0;
            if (val != 0) kkksc = (sum - ans) / val;
            int op = 0;
            if (cnt == 0) op = 0;
            else op = tree.query(low + 1, low + 1);
            // cout << "kkksc = " << kkksc << " op = " << op << endl;
            num += min(kkksc, op);
        }
        // if (tree.query(cnt) == 0)
        // {
        //     cout << 1 << endl;
        // }
        // if (i == 40 && ok && n == 1000)
        // {
        //     cout << 1 << endl;
        //     continue;
        // }
        cout << num + 1 << endl;
        // cout << "----------------------------" << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int test = 1;
    // cin >> test;
    for (int i = 1; i <= test; i++)
    {
        solve();
    }
    return 0;
}