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

struct LowLink {
  using A = vector<int>;
  using B = vector<pair<int, int>>;
  int n;
  vector<vector<int>> es;
  vector<bool> vis;
  vector<int> ord, low;
  A articulation;
  B bridge;
  LowLink(int n) : n(n), es(n) {}
  void add_edge(int v, int u) {
    es[v].push_back(u);
    es[u].push_back(v);
  }
  void dfs(int v, int p, int &k) {
    vis[v] = true;
    ord[v] = k++;
    low[v] = ord[v];
    bool is = false;
    int cnt = 0;
    for (auto u : es[v]) {
      if (vis[u])  {
        if (u != p) low[v] = min(low[v], ord[u]);
        continue;
      }
      cnt++;
      dfs(u, v, k);
      low[v] = min(low[v], low[u]);
      if (p != -1 && ord[v] <= low[u]) is = true;
      if (ord[v] < low[u]) bridge.emplace_back(min(v, u), max(v, u));
    }
    if (p == -1 && cnt > 1) is = true;
    if (is) articulation.push_back(v);
  }
  pair<A, B> build() {
    int k = 0;
    vis.assign(n, false);
    ord.assign(n, 0);
    low.assign(n, 0);
    articulation.clear();
    bridge.clear();
    dfs(0, -1, k);
    return pair<A, B>(articulation, bridge);
  }
};

int main() {
  int N, M; cin >> N >> M;
  auto low = LowLink(N);
  for (int i = 0; i < M; i++) {
    int v, u; cin >> v >> u;
    low.add_edge(v, u);
  }
  auto ans = low.build().first;
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << '\n';
  }
  return 0;
}

