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

using LL = long long;
using ll = long long;

struct fenwick {
    int n;
    vector<LL> s;

    fenwick(int _n) {
        n = _n;
        s.assign(n + 1, {});
    }

    int lowbit(int x) {
        return x & -x;
    }

    void add(int x, int v) {
        while (x <= n) {
            s[x] += v;
            x += lowbit(x);
        }
    }

    LL query(int x) {
        LL res = 0;
        while (x >= 1) {
            res += s[x];
            x -= lowbit(x);
        }
        return res;
    }
};

void solve() {
    int n, q;
    cin >> n >> q;

    vector<int> a(n + 1), b(q + 1), c(q + 1), all{0};
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        all.emplace_back(a[i]);
    }
    for (int i = 1; i <= q; i++) {
        cin >> b[i] >> c[i];
        all.emplace_back(c[i]);
    }

    sort(all.begin() + 1, all.end());
    all.erase(unique(all.begin() + 1, all.end()), all.end());

    int cnt = all.size();
    fenwick bit1(cnt), bit2(cnt);

    auto getid = [&](int x) {
        return lower_bound(all.begin() + 1, all.end(), x) - all.begin();
    };

    auto del = [&](int x) {
        int id = getid(x);
        bit1.add(id, -x);
        bit2.add(id, -1);
    };

    auto add = [&](int x) {
        int id = getid(x);
        bit1.add(id, x);
        bit2.add(id, 1);
    };

    auto findFirst = [&](LL sum) {
        int l = 1, r = cnt;
        int pos = cnt + 1;
        while (l <= r) {
            int m = (l + r) >> 1;
            if (bit1.query(m) >= sum) {
                pos = m;
                r = m - 1;
            } else {
                l = m + 1;
            }
        }
        --pos;
        return bit2.query(pos);
    };

    LL sum = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i] > 0) {
            add(a[i]);
        } else {
            sum += -a[i];
        }
    }

    for (int i = 1; i <= q; i++) {
        int x = a[b[i]], y = c[i];
        if (x <= 0) sum -= -x;
        else del(x);
        if (y > 0) add(y);
        else sum += -y;
        a[b[i]] = y;
        int res2 = findFirst(sum);
        cout << res2 + 1 << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

#ifdef Debug
    assert(freopen("in.txt", "r", stdin));
    assert(freopen("out.txt", "w", stdout));
#endif

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}