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



void bfs(vector<vector<int>> adj,int start,vector<bool> &dvisited)
{
vector<bool> visited(adj.size()+1,false);
queue<int> q;
q.push(start);
visited[start]=true;
while(q.size())
    {
    int u=q.front();q.pop();
    for(int x:adj[u])
        {
        if(adj[x].size()>2)
            {
            visited[x]=1;
            dvisited[x]=1;
            continue;
            }
        if(!visited[x])
            {
            q.push(x);
            visited[x]=true;
            dvisited[x]=true;
            }

        }
    }
}



int main()
{
    int n,m;
    cin>>n>>m;
    vector<vector<int>> adj(n+1);
    int from,to;
    for(int i=0;i<m;i++)
        {
        cin>>from>>to;
        adj[from].push_back(to);
        adj[to].push_back(from);
        }
    queue<int> q;
    vector<bool> visited(n+1,false);
    for(int i=1;i<=n;i++)
        {
        if(adj[i].size()==1){q.push(i);/*visited[i]=true;*/}
        }
    while(q.size())
        {
        if(!visited[q.top])
            bfs(adj,q.front(),visited);
        q.pop();
        }
    int cnt=0;
    for(int i=1;i<=n;i++)
        {
        if(visited[i])
            cnt+=visited[i];
        }

    cout<<cnt<<"\n";
    for(int i=1;i<=n;i++)
        {
        if(visited[i])
            cout<<i<<" ";
        }
    return 0;
}