#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <stack>
#include <deque>
#include <map>
#define ll long long
using namespace std;

ostream& operator<<(ostream& os, const vector<int>& input)
{
    for (auto const& i : input) {
        os << i << " ";
    }
    return os;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<vector<int>>vec(n + 1);
    vector<int>indul(n + 1);

    for (size_t i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        vec[a].push_back(b);
        vec[b].push_back(a);
        indul[a]++;
        indul[b]++;
    }

    vector<int>zsak;
    for (size_t i = 1; i < n + 1; i++)
    {
        if (indul[i] == 1) zsak.push_back(i);
    }

    map<int, int>ki;
    for (int x : zsak)
    {
        vector<bool>visited(n + 1);
        queue<int>q;
        q.push(x);
        visited[x] = true;
        while (!q.empty())
        {
            int i = q.front();
            q.pop();
            for (int j : vec[i])
            {
                if (visited[j] == false)
                {
                    visited[j] = true;

                    if (ki.find(j) == ki.end()) ki[j] = 1;
                    if (vec[j].size() > 2) break;
                    q.push(j);
                }
            }

        }
    }
    cout << ki.size() << endl;
    for (auto i : ki)
    {
        cout << i.first << " ";
    }
    cout << endl;
    return 0;
}
/*
8 9
1 2
1 6
2 7
1 5
3 4
4 5
5 6
6 7
8 7

*/