//g++ k.cpp -o k -g -std=c++14 -O0 -Wall -fsanitize=undefined
#include <iostream>
#include <cstdio>
#include <algorithm>
#define LL long long
using namespace std;
int qd()
{
    int rt = 0, ng = 0;
    char c = getchar();
    while (c < '0' || c > '9')
        ng ^= (c == '-'), c = getchar();
    while ('0' <= c && c <= '9')
        rt = (rt << 3) + (rt << 1) + c - 48, c = getchar();
    return ng ? -rt : rt;
}
const int maxn = 4e5 + 10;
int N, Q, a[maxn], ls[maxn], lstop = 0, qt[maxn][2];
LL nsum;
struct node
{
    int xv, cnt;
    LL v;
} f[maxn << 4];
void pushup(int t) { f[t].v = f[t << 1].v + f[t << 1 | 1].v, f[t].cnt = f[t << 1].cnt + f[t << 1 | 1].cnt; }
void build(int t, int l, int r)
{
    	// printf("%d:%d %d\n",t,l,r);
    if(l>r)  return;
    if (l == r)
    {
        f[t].xv = ls[l];
        return;
    }
    int m = (l + r) >> 1;
    build(t << 1, l, m), build(t << 1 | 1, m + 1, r);
    f[t].xv = max(f[t << 1].xv, f[t << 1 | 1].xv);
}
void change(int t, int l, int r, int v, int num)
{
    if(l>r)  return;
    if (l == r)
    {
        f[t].v += 1LL * ls[l] * num, f[t].cnt += num;
        return;
    }
    int m = (l + r) >> 1;
    f[t << 1].xv >= v ? change(t << 1, l, m, v, num) : change(t << 1 | 1, m + 1, r, v, num);
    pushup(t);
}
int ask(int t, int l, int r, LL v)
{
    if(l>r)  return 0;
    if (v >= f[t].v)
        return f[t].cnt;
    if (l == r)
        return ls[l] ? v / ls[l] : 0;
    int m = (l + r) >> 1;
    return v <= f[t].v ? ask(t << 1, l, m, v) : f[t << 1].cnt + ask(t << 1 | 1, m + 1, r, v - f[t << 1].v);
}
int main()
{
    // freopen("test.in","r",stdin);
    N = qd(), Q = qd();
    for (int i = 1; i <= N; i++)
    {
        a[i] = qd();
        if (a[i] <= 0)
            nsum += a[i];
        else
            ls[++lstop] = a[i];
    }
    for (int i = 1; i <= Q; i++)
    {
        qt[i][0] = qd(), qt[i][1] = qd();
        if (qt[i][1] > 0)
            ls[++lstop] = qt[i][1];
    }
    sort(ls + 1, ls + lstop + 1);
    lstop = unique(ls + 1, ls + lstop + 1) - ls - 1; //printf("%d %d\n\n",lstop,nsum);
    build(1, 1, lstop);
    for (int i = 1; i <= N; i++)
        change(1, 1, lstop, a[i], 1);
    for (int i = 1; i <= Q; i++)
    {
        int t = qt[i][0], x = qt[i][1];
        if (a[t] <= 0)
            nsum -= a[t];
        else
            change(1, 1, lstop, a[t], -1);
        if (x <= 0)
            nsum += x;
        else
            change(1, 1, lstop, x, 1);
        a[t] = x;
         printf("%d\n", ask(1, 1, lstop, -nsum) + 1);
    }
    // while(1);
    return 0;
}