#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<stack>
using namespace std;
struct mzls
{
int to,nt;
}a[200005];
int n,m,ncnt,cnt;
int low[20005],dfn[20005],fa[20005],head[20005],num;
int f1[20005],ans[20005];
stack<int>sta;
inline void add(int x,int y)
{
a[cnt].to=y,a[cnt].nt=head[x],head[x]=cnt++;
a[cnt].to=x,a[cnt].nt=head[y],head[y]=cnt++;
}
inline void dfs(int x)
{
low[x]=dfn[x]=++ncnt;
sta.push(x);
for(int i=head[x];i!=-1;i=a[i].nt)
{
int v=a[i].to;
if(!dfn[v])
{
fa[v]=x;
dfs(v);
low[x]=min(low[x],low[v]);
}
else if(fa[x]!=v)
low[x]=min(low[x],dfn[v]);
}
if(low[x]==dfn[x])
{
num++;
while(!sta.empty())
{
int st=sta.top();
sta.pop();
f1[st]=num;
if(!ans[num]||ans[num]>st)
ans[num]=st;
if(st==x)
break;
}
}
}
int main()
{
memset(head,-1,sizeof(head));
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
add(x,y);
}
for(int i=1;i<=n;i++)
if(!dfn[i])
dfs(i);
printf("%d\n",num);
for(int i=1;i<=n;i++)
printf("%d ",ans[f1[i]]);
}