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

#define PB emplace_back
#define int long long
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define per(i, a, b) for(int i = (a); i >= (b); --i)

const int N = 4e5;
int a, b, p[N + 5], top, s[N + 5];
struct pii {int x, y;} q[N + 5];

struct node {
	int w[N + 5];
	void add(int n, int m) {
		for(; n <= top; n += n & -n) w[n] += m;
	}
	int ask(int n) {
		int res = 0;
		for(; n; n -= n & -n) res += w[n];
		return res;
	}
	int que(int n) {
		int now = 0, res = 0;
		per(i, 20, 0) if(res + (1 << i) <= top && now + w[res + (1 << i)] <= n)
			res += 1 << i, now += w[res];
		return res + 1;
	}
} T1, T2;

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a >> b;
	rep(i, 1, a) {
		cin >> s[i];
		if(s[i] > 0) p[++top] = s[i];
	}
	rep(i, 1, b) {
		cin >> q[i].x >> q[i].y;
		if(q[i].y > 0) p[++top] = q[i].y;
	}
	sort(p + 1, p + top + 1);
	top = unique(p + 1, p + top + 1) - p - 1;
	int cnt = 0, sum = 0;
	rep(i, 1, a) {
		if(s[i] <= 0) sum -= s[i], ++cnt;
		else {
			int x = lower_bound(p + 1, p + top + 1, s[i]) - p;
			T1.add(x, 1);
			T2.add(x, s[i]);
		}
	}
	int z;
	rep(i, 1, b) {
		auto [x, y] = q[i];
		if(s[x] <= 0) {
			sum += s[x];
			--cnt;
		}
		else {
			int y = lower_bound(p + 1, p + top + 1, s[x]) - p;
			T1.add(y, -1);
			T2.add(y, -s[x]);
		}
		s[x] = y;
		if(s[x] <= 0) {
			sum -= s[x];
			++cnt;
		}
		else {
			int y = lower_bound(p + 1, p + top + 1, s[x]) - p;
			T1.add(y, 1);
			T2.add(y, s[x]);
		}
		x = T2.que(sum), z = T2.ask(x);
		// cerr << x << ' ' << z << "#!@#" << endl;
		if(x <= top) y = a - cnt - (T1.ask(x) - (z - sum - 1) / p[x]) + 1;
		else y = 0;
		// cout << x << ' ' << y << "#@#@!" << endl;
		cout << a - cnt - y + 1 << '\n';
	}
	return 0;
}