#include<bits/stdc++.h>
using namespace std;

const int maxn=2e4+10;
const int maxm=1e5+10;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int n,m;
struct Graph{
    vector<int> E[maxn];
    inline void add_edge(int u,int v){
        E[u].push_back(v);
        E[v].push_back(u);
    }
    int dfn[maxn],dfncnt,low[maxn];
    vector<int> ans;
    inline void Tarjan(int rt,int u){
        dfn[u]=++dfncnt,low[u]=dfn[u];
        int cnt_subtree=0;
        for(int v:E[u]){
            if(!dfn[v]){
                Tarjan(rt,v);
                ++cnt_subtree;
                low[u]=min(low[u],low[v]);
                if(low[v]>=dfn[u]) ans.push_back(u);
            }
            else low[u]=min(low[u],dfn[v]);
        }
        if(u==rt&&cnt_subtree>1) ans.push_back(u);
    }
    inline void solve(){
        for(int u=1;u<=n;++u){
            if(!dfn[u]) Tarjan(u,u);
        }
        sort(ans.begin(),ans.end());
        ans.erase(unique(ans.begin(),ans.end()),ans.end());
        for(int i:ans) printf("%d\n",i);
    }
}G;

int main(){
    n=read(),m=read();
    for(int i=1;i<=m;++i){
        int u=read(),v=read();
        G.add_edge(u,v);
    }
    G.solve();
    return 0;
}