#include <iostream>
#include <cstdio>
#include <vector>
#define MAX_N 100005
using namespace std;
int n,m,marcat[MAX_N];
vector<int> v[MAX_N];

void dfs (int j, int comp)
{
    int t;
    marcat[j]=comp;
    for (t=0; t<v[j].size(); ++t)
    {
        if (v[j][t]!=0 && marcat[v[j][t]]==0)
        {
            dfs(v[j][t],comp);
        }
    }
}

int main()
{
    FILE *intrare,*iesire;
    int i,j,x,y,comp=1;
    intrare=fopen("dfs.in","r");
    iesire=fopen("dfs.out","w");
    fscanf(intrare,"%d%d",&n,&m);
    for (i=0; i<=m-1; ++i)
    {
        fscanf(intrare,"%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }

    for (i=1; i<=n; ++i)
    {
        for (j=0; j<v[i].size(); ++j)
        {
            if (v[i][j]!=0 && marcat[v[i][j]]==0)
            {
                dfs(v[i][j],comp);
                ++comp;
            }
        }
    }
    for (i=1; i<=n; ++i)
    printf("%d ",marcat[i]);
    fprintf(iesire,"%d",comp);
    return 0;
}