#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
struct mzls
{
int to,nt;
}a[200005];
int n,m,ncnt,cnt;
int low[20005],dfn[20005],fa[20005],head[20005];
bool f1[20005];
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;
int num=0;
for(int i=head[x];i!=-1;i=a[i].nt)
{
int v=a[i].to;
if(!dfn[v])
{
num++;
fa[v]=x;
dfs(v);
low[x]=min(low[x],low[v]);
if(!fa[x]&&num>1)
f1[x]=1;
if(fa[x]&&low[v]>=dfn[x])
f1[x]=1;
//if(low[v]>dfn[x])
}
else if(fa[x]!=v)//
low[x]=min(low[x],dfn[v]);
}
}
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);
int ans=0;
for(int i=1;i<=n;i++)
if(f1[i])
ans++;
printf("%d\n",ans);
for(int i=1;i<=n;i++)
if(f1[i])
printf("%d ",i);
}