#include <bits/stdc++.h>
#define F_(i, a, b) for (int i = (a); i <= (b); i++)
#define _F(i, a, b) for (int i = (a); i >= (b); i--)
#define vc vector
#define bg begin
#define ed end
#define rbg rbegin
#define red rend
#define pb push_back
#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define pe prev
#define nx next
#define sz size
#define bk back
#define pp pop_back
#define in insert
#define es erase
#define fd find
#define ct count
#define lb lower_bound
#define ub upper_bound
#define IL inline
#define mkp make_pair
#define acc accumulate
#define exg exchange
#define inp inplace_merge
using namespace std;
using ll = long long;
using unt = unsigned;
using pi = pair<int, int>;

template <typename T>
IL void ckm(T &a, const T &b) { (b < a) && (a = b); }
template <typename T>
IL void ckx(T &a, const T &b) { (b > a) && (a = b); }

const int N = 1e5 + 5;
basic_string<double> t[N * 4];
#define ls(x) (x * 2)
#define rs(x) (x * 2 + 1)
int n, m;
IL void U(int o) {
  t[o] = t[ls(o)] + t[rs(o)].substr(ub(t[rs(o)].bg(), t[rs(o)].ed(), t[ls(o)].bk()) - t[rs(o)].bg());
}
void C(int x, int y, int o = 1, int L = 1, int R = n) {
  if (L == R)
    return t[o].resize(1), t[o].bk() = 1. * y / x, void();
  int M = (L + R) / 2;
  x <= M ? C(x, y, ls(o), L, M) : C(x, y, rs(o), M + 1, R);
  U(o);
}

signed main() {
  cin.tie(0) -> sync_with_stdio(false);
  cin >> n >> m;
  for (int tim = 1, x, y; tim <= m; tim++) {
    cin >> x >> y, C(x, y);
    cout << t[1].sz() << '\n';
  }
  return 0;
}