using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;
        var L = new LowLink();
        var G = L.Input(N, M, false, 0);
        L.Run(G);
        L.articulation.Sort();
        foreach (var item in L.articulation)
        {
            WriteLine(item);
        }
    }

}

class LowLink
{
    bool[] used;
    int[] ord, low;
    public List<int> articulation;
    public List<pair> bridge;
    List<int>[] G;

    public List<int>[] Input(int n, int m, bool dir = false, int indexed = 1, bool cost = false)
    {
        var cin = new Scanner();
        var G = new List<int>[n];
        for (int i = 0; i < G.Length; i++)
        {
            G[i] = new List<int>();
        }
        for (int i = 0; i < m; i++)
        {
            int a = cin.nextint - indexed;
            int b = cin.nextint - indexed;
            G[a].Add(b);
            if (!dir) G[b].Add(a);
            if (cost) { var tmp = cin.next; }
        }
        return G;
    }
    public void Run(List<int>[] G)
    {
        this.G = G;
        int n = G.Length;
        used = new bool[n];
        ord = new int[n];
        low = new int[n];
        articulation = new List<int>();
        bridge = new List<pair>();
        int k = 0;
        for (int i = 0; i < n; i++)
        {
            if (used[i]) continue;
            k = dfs(i, k, -1);
        }
    }
    int dfs(int idx, int k, int par)
    {
        used[idx] = true;
        ord[idx] = k++;
        low[idx] = ord[idx];
        bool is_articulation = false;
        int cnt = 0;
        foreach (var to in G[idx])
        {
            if (!used[to])
            {
                cnt++;
                k = dfs(to, k, idx);
                low[idx] = Min(low[idx], low[to]);
                is_articulation |= par != -1 && low[to] >= ord[idx];
                if (ord[idx] < low[to]) bridge.Add(new pair(Min(idx, to), Max(idx, to)));
            }
            else if (to != par)
            {
                low[idx] = Min(low[idx], ord[to]);
            }
        }
        is_articulation |= par == -1 && cnt > 1;
        if (is_articulation) articulation.Add(idx);
        return k;
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}



Measured memory_bytes: 29384