#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+9;
int fir[maxn],sec[maxn],ans[maxn]={0};
int have[maxn];
int main(){
	freopen("usaco_20Open_cereal.in","r",stdin);
    freopen("usaco_20Open_cereal.out","w",stdout);
    int m,n;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
    	scanf("%d%d",&fir[i],&sec[i]);
	}
	int tot=0;
	for(int i=n;i>=1;i--){
		int qwq=i,eats=fir[i];
		while(true){
			if(!have[eats]){
				have[eats]=qwq;
				tot++;
				break;
			}
			else if(have[eats]<qwq) break;
			else{
				int ovo=have[eats];
				have[eats]=qwq;
				if(eats==sec[ovo]) break;
				qwq=ovo;
				eats=sec[ovo];
			}
		}
		ans[i]=tot; 
	}
	for(int i=1;i<=n;i++){
		printf("%d\n",ans[i]);
	}
	return 0;
}