#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
const int N = 4e5 + 10;
//#define int long long

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

struct BIT {
	ll a[N];
	void add(int x, int k) {
		for (int i = x; i < N; i += lowbit(i))
			a[i] += k;
	}
	int get(int x) {
		ll ans = 0;
		for (int i = x; i; i -= lowbit(i)) {
			ans += a[i];
		}
		return ans;
	}
} t1, t2;
int n, q, cnt = 0;
int a[N], b[N];
ll s1 = 0, c2 = 0, c1 = 0;

void solve() {

	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (a[i] > 0) {
			b[++cnt] = a[i];
			c2++;
		} else if (a[i] < 0) {
			s1 += abs(a[i]);
			c1++;
		}
	}
	vector<pair<int, int>>ask(q + 1);
	for (int i = 1; i <= q; i++) {
		cin >> ask[i].first >> ask[i].second;
		if (ask[i].second > 0)
			b[++cnt] = ask[i].second;
	}
	sort(b + 1, b + 1 + cnt);
	int len = unique(b + 1, b + 1 + cnt) - b - 1;
	for (int i = 1; i <= n; i++) {
		int pos = lower_bound(b + 1, b + 1 + len, a[i]) - b;
		if (a[i] > 0) {
			t1.add(pos, 1);
			t2.add(pos, a[i]);
		}
	}
	for (int _ = 1; _ <= q; _++) {
		auto [p1, x] = ask[_];
		int pos = lower_bound(b + 1, b + 1 + len, x) - b;
		if (x > 0) {
			t1.add(pos, 1);
			t2.add(pos, x);
			c2++;
		} else if (x < 0)
			s1 += abs(x);
		if (a[p1] > 0) {
			int pos = lower_bound(b + 1, b + 1 + len, a[p1]) - b;
			//cout << pos << ' ';
			t1.add(pos, -1);
			t2.add(pos, -a[p1]);
			c2--;
		} else if (a[p1] < 0)
			s1 -= abs(a[p1]);
		a[p1] = x;
		//cout << s1 << ' ';
		int l = 1, r = len, p2 = -1;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (t2.get(mid) >= s1) {
				p2 = mid;
				r = mid - 1;
			} else
				l = mid + 1;
		}
		if (p2 == -1) {
			cout << c2 + 1 << '\n';
			continue;
		}
		int cnt2 = t1.get(p2);
		ll sum = t2.get(p2);
		//cout << sum << ' ' << cnt2 << ' ';
		sum -= s1;
		cnt2 -= (sum + b[p2] - 1) / b[p2];
		r = c2, l = c2 - cnt2;
		//cout << l << ' ' << r << ' ';
		cout << r - l + 1 << '\n';
	}
}

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