#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;

int n, m;
long long sum, cnt;
long long a[N], p[N], w[N];
vector<int>num;
long long tree[N << 2];
int siz[N << 2];

void update(int i, int l, int r, int pos, long long qw, int qsiz)
{
    if(l > r) return;
    if(l == r)
    {
        tree[i] += qw;
        siz[i] += qsiz;
        return;
    }
    int mid = (l + r) >> 1;
    if(pos <= mid) update(i << 1,l,mid,pos,qw,qsiz);
    else update(i << 1|1,mid + 1,r,pos,qw,qsiz);
    tree[i] = tree[i << 1] + tree[i << 1|1];
    siz[i] = siz[i << 1] + siz[i << 1|1];
}

long long query(int i, int l, int r, long long k)
{
    if(l > r) return 0;
    if(k >= siz[i]) return tree[i];
    if(l == r) return k * num[l - 1];
    int mid = (l + r) >> 1;
    if(k > siz[i << 1]) return tree[i << 1] + query(i << 1 | 1,mid + 1,r,k - siz[i << 1]);
    return query(i << 1,l,mid,k);
}

void solve()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if(a[i] > 0) num.push_back(a[i]), cnt++;
        else sum -= a[i];
    }
    for(int i = 1; i <= m; i++)
    {
        cin >> p[i] >> w[i];
        if(w[i] > 0) num.push_back(w[i]);
    }
    sort(num.begin(),num.end());
    num.erase(unique(num.begin(),num.end()) ,num.end());
    for(int i = 1; i <= n; i++)
    {
        int pos = lower_bound(num.begin(),num.end(),a[i]) - num.begin() + 1;
        update(1,1,num.size(),pos,a[i],1);
    }
    for(int i = 1; i <= m; i++)
    {
        if(a[p[i]] <= 0) sum += a[p[i]];
        else
        {
            cnt--;
            int pos = lower_bound(num.begin(),num.end(),a[p[i]]) - num.begin() + 1;
            update(1,1,num.size(),pos,-a[p[i]],-1);
        }
        a[p[i]] = w[i];
        if(w[i] <= 0) sum -= w[i];
        else
        {
            cnt++;
            int pos = lower_bound(num.begin(),num.end(),w[i]) - num.begin() + 1;
            update(1,1,num.size(),pos,w[i],1);
        }
        int l = 1, r = cnt, p = 0;
        while(l <= r)
        {
            int mid = (l + r) >> 1;
            long long Qsum = query(1,1,num.size(),mid);
            if(Qsum <= sum) p = mid,l = mid + 1;
            else r = mid - 1;
        }
        cout << p + 1 << "\n";
    }
}

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