#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
using ll = long long;
mt19937_64 rd(time(0));
template <class K, class C = less<>> using paring_heap = __gnu_pbds::priority_queue<K, C>;
template <class K, class V = null_type, class C = less<>> using rb_tree = tree<K, V, C, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class ... A> void debug(const T & t, const A & ... a) { cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n"; }
const ll mod = [](bool n) { return n ? 998244353 : 1e9 + 7; } (1);

template <ll mod = mod> ll binpow(ll a, ll b, ll res = 1) {
    for (a %= mod; b; b >>= 1, (a *= a) %= mod) {
        if (b & 1) (res *= a) %= mod;
    }
    return res;
}

template <class type = int, int len = 2> struct Tarjan_cut : vector<vector<signed>> {
    vector<array<type, len>> e; // {u, v}
    vector<signed> dfn, low, cut;
    vector dc = {};
    Tarjan_cut(int n, int m) : vector(n), e(m), dfn(n), low(n), cut(n) {}
    void operator()(stack<signed> s = {}, int tot_dfn = 0) {    // !!使用时需要去自环, 会包含 0 , 0 可能成孤岛
        for (int rt = 0; rt < size(); rt++) {
            auto self = [&](auto && self, int u, int cnt = 0) -> void {
                s.emplace(u), dfn[u] = low[u] = ++tot_dfn;
                if (u == rt && !at(u).size()) dc.emplace_back(1, u);    // u 是根节点且没有邻边，孤岛
                for (auto & i : at(u)) {
                    int v = e[i][0] ^ e[i][1] ^ u;
                    if (!dfn[v]) {
                        self(self, v), low[u] = min(low[u], low[v]);
                        if (low[v] >= dfn[u]) {
                            if (cnt++, u != rt || cnt > 1) cut[u] = true;   // 是割点
                            for (dc.emplace_back(1, u); dc.back().size() == 1 || dc.back().back() != v; ) {
                                dc.back().emplace_back(s.top()), s.pop();
                            }
                        }
                    } else low[u] = min(low[u], dfn[v]);
                }
            };
            if (!dfn[rt]) self(self, rt), s = {};
        }
    }
};


void QAQ() {
    int n, m;
    cin >> n >> m;

    Tarjan_cut adj(n + 1, m);

    for (int i = 0, u, v; i < m; i++) {
        cin >> u >> v;
        adj[u].emplace_back(i), adj[v].emplace_back(i);
        adj.e[i] = {u, v};
    }

    adj();
    vector<signed> cut;
    for (int i = 1; i <= n; i++) {
        if (adj.cut[i]) cut.emplace_back(i);
    }

    cout << cut.size() << "\n";

    for (auto & x : cut) {
        cout << x << "\n";
    }
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    for (cout << fixed << setprecision(12); t--; QAQ());
}