#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define endl "\n"

const int N = 4e5 + 10;
const ll INF = 0x3f3f3f3f3f3f3f;

ll n, m;
ll q;
vector<ll> a(N), tmp(N, 0);
map<ll, ll> mp;
struct node
{
  int l, r;
  ll cnt;
  ll sum;
} t[N << 2];
#define lu u << 1
#define ru u << 1 | 1

void build(int u, int l, int r)
{
  t[u] = {l, r, 0, 0};
  if (l == r)
    return;
  int mid = (l + r) >> 1;
  build(lu, l, mid);
  build(ru, mid + 1, r);
}

void upd(int u, int pos, ll val)
{
  if (t[u].l == t[u].r)
  {
    t[u].cnt++;
    t[u].sum += val;
    return;
  }
  int mid = (t[u].l + t[u].r) >> 1;
  if (pos <= mid)
    upd(lu, pos, val);
  else
    upd(ru, pos, val);
  t[u].cnt = t[lu].cnt + t[ru].cnt;
  t[u].sum = t[lu].sum + t[ru].sum;
}

void del(int u, int pos, ll val)
{
  if (t[u].l == t[u].r)
  {
    t[u].cnt--;
    t[u].sum -= val;
    return;
  }
  int mid = (t[u].l + t[u].r) >> 1;
  if (pos <= mid)
    del(lu, pos, val);
  else
    del(ru, pos, val);
  t[u].cnt = t[lu].cnt + t[ru].cnt;
  t[u].sum = t[lu].sum + t[ru].sum;
}

ll ask(int u, int l, int r)
{
  if (t[u].l >= l && t[u].r <= r)
    return t[u].cnt;
  int mid = (t[u].l + t[u].r) >> 1;
  ll res = 0;
  if (r > mid)
    res += ask(ru, l, r);
  if (l <= mid)
    res += ask(lu, l, r);
  return res;
}
ll askpre(int u, int l, int r)
{
  if (t[u].l >= l && t[u].r <= r)
    return t[u].sum;
  int mid = (t[u].l + t[u].r) >> 1;
  ll res = 0;
  if (r > mid)
    res += askpre(ru, l, r);
  if (l <= mid)
    res += askpre(lu, l, r);
  return res;
}

int bs(int u,ll tar){
  if(t[u].l==t[u].r)return t[u].l;
  if(t[lu].sum>=tar)return bs(lu,tar);
  return bs(ru,tar-t[lu].sum);
}
void solve()
{
  cin >> n >> q;
  set<ll> st;
  ll fu = 0;
  for (int i = 1; i <= n; i++)
  {
    cin >> a[i];
    if (a[i] < 0)
      fu++;
    if (a[i] == 0)
      continue;
    st.insert(a[i]);
  }
  vector<pll> qry(q + 5);
  for (int i = 1; i <= q; i++)
  {
    cin >> qry[i].first >> qry[i].second;
    if (qry[i].second)
      st.insert(qry[i].second);
  }
  int tt = 1;
  for (auto e : st)
  {
    tmp[tt] = e;
    mp[e] = tt++;
  }
  build(1, 1, tt);
  for (int i = 1; i <= n; i++)
  {
    if (a[i])
      upd(1, mp[a[i]], a[i]);
  }
  for (int i = 1; i <= q; i++)
  {
    if (a[qry[i].first])
      del(1, mp[a[qry[i].first]], a[qry[i].first]);
    if (qry[i].second)
      upd(1, mp[qry[i].second], qry[i].second);
    if (a[qry[i].first] < 0)
      fu--;
    if (qry[i].second < 0)
      fu++;
    a[qry[i].first] = qry[i].second;
    int l=1,r=tt;
    while(l<=r){
      int mid=(l+r)>>1;
      if(askpre(1,1,mid)>0){
        r=mid-1;
      }
      else l=mid+1;
    }
    // int pos=r;
    int pos=bs(1,0);
    ll pre = askpre(1, 1, pos);
    ll ans = ask(1, 1, pos);
    // cout<<"pos:"<<pos<<endl;
    // cout<<"pre:"<<pre<<endl;
    // cout<<"ans:"<<ans<<endl;
    if (pre > 0)
    {
      ll qwq = tmp[pos];
      ans-=(pre+qwq-1)/qwq;
    }
    if (pre < 0 && pos < tt - 1)
    {
      ll qwq = tmp[pos + 1];
      ans += (-pre) / qwq;
    }
    cout << ans - fu + 1 << endl;
  }
}

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