#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int main()
{
    int n,m;
    cin >> n >> m;
    vector<int> adj[n];
    for(int i = 0; i < m; i++)
    {
        int x,y;
        cin >> x >> y;
        adj[x-1].push_back(y-1);
        adj[y-1].push_back(x-1);
    }
    queue<int> q;
    int votmazs[n] = {0};
    int zsakfalvak[n] = {0};
    vector<int>zsakok;
    for(int i = 0; i < n; i ++)
    {
        if(adj[i].size()==1)
        {
            zsakok.push_back(i);
        }
    }
    int hany = 0;
    for(int i = 0; i < zsakok.size(); i++)
    {
    q.push(zsakok[i]);
    int votma[n] = {0};
    votma[zsakok[i]]=1;
    int zsakfalu[n] ={0};
    zsakfalu[zsakok[i]]=1;
    while(!q.empty())
    {
        int akt = q.front();
        q.pop();
        for(auto x : adj[akt])
        {
            //cout << akt << " "<< x << " " << adj[akt].size() <<" "<< zsakfalu[x] << endl;
            if(zsakfalu[akt]==1  && (adj[akt].size()==2 or adj[akt].size()==1))
            {
                zsakfalu[x]=1;
                if(votmazs[x]==0 && votma[x]==0)
                {
                    hany++;
                    zsakfalvak[x]=1;
                    votmazs[x]=1;
                }
                //cout << x << endl;
                if(votma[x]==0)
                {
                    votma[x]=1;
                    q.push(x);
                }
            }
        }
    }
    }
    cout << hany << endl;
    if(hany == 0)
        return 0;
    for(int i = 0; i < n; i++)
    {
        if(zsakfalvak[i]==1 && adj[i].size()!=1)
            cout << i+1 << " ";
    }
    return 0;
}