#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 20000;
vector<int> g[maxn + 5];
vector<int> out;
int dfn[maxn + 5], low[maxn + 5], stamp;
void tarjan(int u, int fa) {
	dfn[u] = low[u] = ++stamp;
	for (int v : g[u]) 
		if (v != fa) {
			if (!dfn[v]) {
				tarjan(v, u);
				low[u] = min(low[u], low[v]);
			} else low[u] = min(low[u], dfn[v]);
		}
	if (low[u] == dfn[u]) out.PB(u); 
}
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int u, v;
		scanf("%d%d", &u, &v);
		g[u].PB(v), g[v].PB(u);
	}
	for (int i = 1; i <= n; i++)
		if (!dfn[i]) tarjan(i, 0);
	sort(out.begin(), out.end());
	for (int x : out) printf("%d\n", x);
}