#include<iostream>
#include<string.h>
#include<math.h>
#define ll long long
using namespace std;
ll a[100005], b[100005], c[100005], p[10005];
ll n, m;
void init()
{
    for (int i = 0; i < n; i++)
        p[i] = i;
}
ll find(ll x)
{
    if (x == p[x])
        return x;
    else
        return p[x] = find(p[x]);
}
int main()
{
    while (scanf("%lld%lld", &n, &m) == 2)
    {
        init();
        for (int i = 1; i <= m; i++)
        {
            scanf("%lld%lld", &a[i], &b[i]);
        }
        c[m] = n;//m个元素之间都没有连接，此时分成n个集合
        for (int i = m; i > 1; i--)//m!=0,所以i!=1
        {
            ll tx, ty;
            tx = find(a[i]);
            ty = find(b[i]);
            if (tx == ty)
                c[i - 1] = c[i];
            else
            {
                c[i - 1] = c[i] - 1;
                p[tx] = ty;
            }
        }
        for (int i = 1; i <= m; i++)
        {
            printf("%lld\n", c[i]);
        }
    }
    system("pause");
    return 0;
}