#include <stdio.h>

int father[10005];
int x[100005], y[100005], num[100005];

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

int FindSet(int x)
{
    if(x != father[x])
    {
        father[x] = FindSet(father[x]);
    }

    return father[x];
}


int main()
{
    int n, m, a, b;

    while(scanf("%d%d", &n, &m)!=EOF)
    {

        for(int i = 0; i<m; i++)
        {
            scanf("%d%d", &x[i], &y[i]);
        }
        
        MakeSet(n);
        
        num[m-1] = n;

        for(int i = m-1; i>0; i--)
        {
            a = FindSet(x[i]);
            b = FindSet(y[i]);
            if(a != b)
            {
                father[a] = b;
                num[i-1] = num[i]-1;
            }
            else
                num[i-1] = num[i];
        }

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

    }

    return 0;
}