#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((long long)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n)                                                             \
    vector<int> od(n);                                                         \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    long long __VA_ARGS__;                                                     \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238

struct TwoEdgeCC {
    int n, pos;
    vector<int> ord, low, par, blg, num;
    vector<vector<int>> G, C, T;
    vector<vector<pair<int, int>>> E;

    vector<int> ap;
    vector<pair<int, int>> bs, cand;

    TwoEdgeCC(int n)
        : n(n), pos(0), ord(n, -1), low(n), par(n, -1), blg(n, -1), num(n, 1), G(n) {}

    void add_edge(int u, int v) {
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    bool is_bridge(int u, int v) {
        if(ord[u] > ord[v]) swap(u, v);
        return ord[u] < low[v];
    }

    void dfs(int v) {
        ord[v] = low[v] = pos++;
        for(int u : G[v]) {
            if(u == par[v]) continue;
            if(ord[u] < ord[v]) cand.emplace_back(min(u, v), max(u, v));
            if(~ord[u]) {
                low[v] = min(low[v], ord[u]);
                continue;
            }
            par[u] = v;
            dfs(u);
            num[v] += num[u];
            low[v] = min(low[v], low[u]);
            if(is_bridge(u, v)) bs.emplace_back(u, v);
            if(low[u] >= ord[v]) {
                E.emplace_back();
                while(1) {
                    auto e = cand.back();
                    cand.pop_back();
                    E.back().emplace_back(e);
                    if(make_pair(min(u, v), max(u, v)) == e) break;
                }
            }
        }
    }

    void fill_component(int v) {
        C[blg[v]].emplace_back(v);
        for(int u : G[v]) {
            if(~blg[u] || is_bridge(u, v)) continue;
            blg[u] = blg[v];
            fill_component(u);
        }
    }

    void add_component(int v, int &k) {
        if(~blg[v]) return;
        blg[v] = k++;
        C.emplace_back();
        fill_component(v);
    }

    int build() {
        for(int i = 0; i < n; i++)
            if(ord[i] < 0) dfs(i);

        vector<int> cnt(n, 0);
        for(int i = 0; i < n; i++) {
            int p = par[i];
            if(p < 0) continue;
            if(par[p] < 0)
                cnt[p]++;
            else if(ord[p] <= low[i])
                ap.emplace_back(p);
        }

        for(int i = 0; i < n; i++)
            if(cnt[i] > 1) ap.emplace_back(i);

        sort(ap.begin(), ap.end());
        ap.erase(unique(ap.begin(), ap.end()), ap.end());

        int k = 0;
        for(int i = 0; i < n; i++) add_component(i, k);

        T.assign(k, vector<int>());
        for(auto e : bs) {
            int u = blg[e.first], v = blg[e.second];
            T[u].emplace_back(v);
            T[v].emplace_back(u);
        }
        return k;
    }
};

signed main() {
    cinfast();
    LCIN(N, M);
    TwoEdgeCC tcc(N);
    REP(i, M) {
        LCIN(s, t);
        tcc.add_edge(s, t);
    }
    ll k = tcc.build();
    FOREACH(v, tcc.ap) { cout << v << "\n"; }
}



Measured memory_bytes: 8172