#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 #define MAXN 10100

 #define MAXM 1001000

 struct Edge{

     int u,v;

 }edge[MAXM];

 int n,m,ans[MAXM];

 int parent[MAXN];

 int Find(int x)

 {

     if(x==parent[x]){

         return parent[x];

     }

     parent[x]=Find(parent[x]);

     return parent[x];

 }

 void Union(int u,int v)

 {

     int r1=Find(u),r2=Find(v);

     if(r1==r2)return ;

     parent[r1]=r2;

 }

 int main()

 {

     int k;

     while(~scanf("%d%d",&n,&m)){

         for(int i=;i<n;i++)parent[i]=i;

         for(int i=;i<m;i++){

             scanf("%d%d",&edge[i].u,&edge[i].v);

         }

         ans[m-]=n;

         k=m-;

         for(int i=m-;i>=;i--){

             int u=edge[i].u,v=edge[i].v;

             if(Find(u)!=Find(v)){

                 Union(u,v);

                 ans[k-]=ans[k]-;

             }else

                 ans[k-]=ans[k];

             k--;

         }

         for(int i=;i<m;i++){

             printf("%d\n",ans[i]);

         }

     }

     return ;

 }