#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;
using ll = long long;

const int N = 4e5 + 10;

int n, q, a[N], idx[N], x[N];
map<int, int> mp;

struct Tree{
    int n, c[N], num[N];

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

    void modify(int x, int val){
        for (; x <= n; x += lowbit(x)) c[x] += val;
    }

    void modify_num(int x, int val){
        for (; x <= n; x += lowbit(x)) num[x] += val;
    }

    ll query(int x){ //[1, x]
        ll res = 0;
        for (; x; x -= lowbit(x)) res += c[x];
        return res;
    }

    ll query_num(int x){ //[1, x]
        ll res = 0;
        for (; x; x -= lowbit(x)) res += num[x];
        return res;
    }

    int check(ll sum){
        int l = 1, r = n;
        while (l < r){
            int mid = (l + r + 1) / 2;
            if (query(mid) <= sum) l = mid;
            else r = mid - 1;
        }
        return query_num(l);
    }
}g;

void solve(){
    cin >> n >> q;
    for (int i = 1; i <= n; i ++ ) cin >> a[i];
    for (int i = 1; i <= q; i ++ ) cin >> idx[i] >> x[i];

    vector<int> v(1);
    for (int i = 1; i <= n; i ++ ){
        if (a[i] > 0){
            v.push_back(a[i]);
        }
    }
    for (int i = 1; i <= q; i ++ ){
        if (x[i] > 0){
            v.push_back(x[i]);
        }
    }
    v.push_back(0);
    sort(v.begin() + 1, v.end());
    for (int i = v.size()-1; i >= 0; i -- ){
        mp[v[i]] = i + 1;
    }

    ll sum = 0;
    g.n = v.size();
    for (int i = 1; i <= n; i ++ ){
        if (a[i] > 0){
            int ip = mp[a[i]] ++;
            g.modify(ip, a[i]);
            g.modify_num(ip, 1);
        }else{
            sum += a[i];
        }
    }

    for (int i = 1; i <= q; i ++ ){
        int y = idx[i];

        if (a[y] <= 0){
            sum -= a[y];
        }else{
            int ip =  -- mp[a[y]];
            g.modify(ip, - a[y]);
            g.modify_num(ip, -1);
        }
        a[y] = x[i];
        if (a[y] <= 0){
            sum += a[y];
        }else{
            int ip = mp[a[y]] ++;
            g.modify(ip, a[y]);
            g.modify_num(ip, 1);
        }

        //二分答案
        cout << g.check( - sum) + 1 << '\n';
    }
}

signed main(){
    IOS;
    int t = 1;
//		cin >> t;
    while (t -- ){
        solve();
    }
    return 0;
}