#include<iostream>

 #include<cstdio>

 #include<cstring>

 using namespace std;

 int n, m, tot, num;

 int p[], ans[], head[];

 struct node

 {

     int u,v;

 }query[];

 struct edge

 {

     int v,next;

 }e[];

 void addEdge(int u, int v)

 {

     e[tot].v = v;

     e[tot].next = head[u];

     head[u] = tot++;

 }

 int finds(int x)

 {

     return p[x]==x?x:p[x]=finds(p[x]);

 }

 void update(int u)

 {

     for(int i=head[u];i!=-;i=e[i].next)

     {

         int v = e[i].v;

         int x = finds(u);

         int y = finds(v);

         if(x!=y)  {p[x]=y;num--;}

     }

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

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

     {

         tot = ;

         memset(head,-,sizeof(head));

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

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

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

         num = n;

         ans[m] = n;

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

         {

             int u = query[i].u;

             int v = query[i].v;

             addEdge(u,v);

             addEdge(v,u);

             update(u);

             update(v);

             ans[i-]=num;

         }

         for(int i=;i<=m;i++)  printf("%d\n",ans[i]);

     }

     return ;

 }