#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

class LowLink{
private:
    int N,inc;
    vector<int> ord,low;
public:
    vector<vector<int>> edge;
    vector<int> articulation;
    vector<pair<int,int>> bridge;

    LowLink(int N) : N(N),edge(N),ord(N,-1),low(N,0) {
        // do nothing
    }
    void make_edge(int from, int to) {
		edge[from].push_back(to);
	}
    void solve() {
        inc = 0;
        for(int i = 0; i < N; ++i) if(ord[i]==-1) dfs(i,-1);
    }
private:
    void dfs(int curr,int prev) {
        ord[curr] = inc++;
        low[curr] = ord[curr];
        int isArticulation = 0;
        int cnt = 0;
        for(int next:edge[curr]) {
            if(next == prev) continue;
            if(ord[next]==-1){
                cnt++;
                dfs(next,curr);
                low[curr] = min(low[curr],low[next]);
                if(prev != -1 && low[next] >= ord[curr]) isArticulation = 1;
                if(ord[curr]<low[next]) bridge.push_back({curr,next});
            }
            else{
                low[curr] = min(low[curr],ord[next]);
            }
        }
        if(prev==-1 && cnt>1) isArticulation = 1;
        if(isArticulation) articulation.push_back(curr);
    }
};

int main() {
    int N,M; cin >> N >> M;
    LowLink link(N);
    for(int i = 0; i < M; ++i){
        int u,v; cin >> u >> v;
        link.make_edge(u,v);
        link.make_edge(v,u);
    }
    link.solve();
    sort(ALL(link.articulation));
    for(auto& e:link.articulation) cout << e << endl;
    return 0;
}


Measured memory_bytes: 4376