#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>

using namespace std; 

const int MAXN = 10000;
const int MAXM = 100000;
int father[MAXN + 100];
int u[MAXM + 100];
int v[MAXM + 100];
int ans[MAXM + 100];
int n,m,num;

void initt(){
    for(int i = 0;i < n;i++){
        father[i] = i;
    }
    return;
}

int findd(int u){
    if(father[u] == u)
        return father[u];
        
    father[u] = findd(father[u]);
    return father[u];
}
void mergee(int u,int v){
    int fatu = findd(u);
    int fatv = findd(v);
    if(fatu != fatv){
        num--;
        father[fatu] = fatv;
    }
}

int main(){
    while(~scanf("%d%d",&n,&m)){
        //initt();
        for(int i = 0;i < n;i++){
            father[i] = i;
        }
        for(int i = 0;i < m;i++){
            scanf("%d%d",u+i,v+i);
        }
        
        num = n;
        for(int i = m-1;i >= 1;i--){
            mergee(u[i],v[i]);
            ans[i] = num;
        }
        ans[m] = n;
        for(int i = 1;i <= m;i++){
            printf("%d\n",ans[i]);
        }
    }
    
    return 0;
}