#include<bits/stdc++.h>
using i64 = long long;
const int N = 20005, M = 1e5 + 10;
int read(){
	int x = 0, f = 1, c = getchar();
	while(!isdigit(c)){
		if(c == '-') f = -1;
		c = getchar();
	}
	while(isdigit(c)){
		x = x * 10 + (c ^ 48);
		c = getchar();
	}
	return x * f;
}
int n, m, dfn[N], dfncnt, low[N], vis[N], brid[N];
std::vector<int> E[N];
void dfs(int x, int f){
	vis[x] = 1;
	low[x] = dfn[x] = ++ dfncnt;
	int cnt = 0;
	for(auto i: E[x]){
		if(i == f) continue;
		if(!vis[i]){
			dfs(i, x);
			low[x] = std::min(low[x], low[i]);
		}else low[x] = std::min(low[x], dfn[i]);
		if(low[i] >= dfn[x]) cnt ++;
	}
	if(x == 1 && cnt >= 2) brid[x] = 1;
	if(x != 1 && cnt) brid[x] = 1;
}
void solve(){
	n = read(), m = read();
	for(int i = 1; i <= m; i ++){
		int x = read(), y = read();
		E[x].push_back(y), E[y].push_back(x);
	}
	dfs(1, 1);
	for(int i = 1; i <= n; i ++){
		if(brid[i]) std::cout << i << '\n';
	}
}
signed main(){
	solve();
	return 0;
}