#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

#define lc x<<1

#define rc x<<1|1

#define mid ((l+r)>>1)

#define lson x<<1,l,mid

#define rson x<<1|1,mid+1,r

using namespace std;

typedef long long ll;

const int N=1e5+;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-;c=getchar();}

    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}

    return x*f;

}

int n,Q,a,b;

struct Node{

    int ls;

    double mx;

    Node():ls(),mx(0.0){}

}t[N<<];

int cal(int x,int l,int r,double v){

    if(l==r) return t[x].mx>v;

    if(t[lc].mx<=v) return cal(rson,v);

    else return t[x].ls-t[lc].ls+cal(lson,v);

}

inline void merge(int x,int l,int r){

    t[x].mx=max(t[lc].mx,t[rc].mx);

    t[x].ls=t[lc].ls+cal(rson,t[lc].mx);

}

void segCha(int x,int l,int r,int p,double v){

    if(l==r) t[x].ls=,t[x].mx=v;

    else{

        if(p<=mid) segCha(lson,p,v);

        if(mid<p) segCha(rson,p,v);

        merge(x,l,r);

    }

}

int main(){

    freopen("in","r",stdin);

    n=read();Q=read();

    while(Q--){

        a=read();b=read();

        segCha(,,n,a,(double)b/a);

        printf("%d\n",t[].ls);

    }

}