#include <bits/stdc++.h>

#define ll long long

constexpr int N = 4e5;
int tot = 0,root = 0;
struct info{
	ll val, size;
};
struct node{
	int ls, rs;
    info s;
}tree[N * 4];
#define lson tree[id].ls
#define rson tree[id].rs
info operator + (const info &l, const info &r){
	info rt = {0, 0};
	if (l.size && r.size){
		rt.size = l.size + r.size;
		rt.val = l.val + r.val;
	}else if (l.size){
		rt = l;
	}else if (r.size){
		rt = r;
	}
	return rt;
}
void updata(int id){
    tree[id].s = tree[lson].s + tree[rson].s;
}
void add(int &id, int l, int r, int pos, int t){
    if (!id) {
        id = ++tot;
        tree[id].s = {0, 0};
        tree[id].ls = tree[id].rs = 0;
    }
    if (l == r){
    	tree[id].s.val += pos * t;
    	tree[id].s.size += t;
        return;
    }
    int mid = l + r >> 1;
    if (pos <= mid) add(lson, l, mid, pos, t);
    if (pos > mid) add(rson, mid + 1, r, pos, t);
    updata(id);
}
int query(int id, int l, int r, ll sum){
	if (!id){
		return 0;
	}
	int mid = l + r >> 1;
	if (tree[lson].s.val > sum){
		return query(lson, l, mid, sum);
	}else{
		ll ans = 0;
		ans += tree[lson].s.size;
		sum -= tree[lson].s.val;
		ans += query(rson, mid + 1, r, sum);
		return ans;
	}
}


int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n, q;
	std::cin >> n >> q;

	std::vector<int> a(n);
	constexpr int inf = 1E9;
	ll sum = 0;
	for (int i = 0; i < n; i++){
		std::cin >> a[i];
		if (a[i] <= 0){
			sum += -a[i];
		}else{
			add(root, 1, inf, a[i], 1);
		}
	}
	while (q--){
		int x, v;
		std::cin >> x >> v;
		x--;
		if (a[x] > 0){
			add(root, 1, inf, a[x], -1);
		}else{
			sum -= (-a[x]);
		}
		if (v > 0){
			add(root, 1, inf, v, 1);
		}else{
			sum += (-v);
		}
		a[x] = v;
		// for (int i = 0; i < n; i++){	
		// 	std::cout << a[i] << " \n"[i == n - 1];
		// }
		// std::cerr << "SSS " << tree[1].s.val << ' ' << tree[1].s.size << " " << sum << "\n";
		std::cout << query(1, 1, inf, sum) + 1 << '\n';
	}

	return 0;
}