#include <iostream>
#include <vector>
#include <set>

using namespace std;

void solver(vector <bool> &visit,int s,vector<vector<int>> &graph,set<int> &ans)
{
if(graph[s].size()==2)
    {
    ans.insert(s);
    visit[s]=true;
    for(auto x : graph[s])
        {
        if(!visit[x])
            solver(visit,x,graph,ans);
        }
    }
else
    {
    visit[s]=true;
    ans.insert(s);
    }


}



int main()
{
    int n,m;
    cin>>n>>m;
    vector<vector<int>> graph(n+1);
    int tmp1,tmp2;
    for(int i=0;i<m;i++)
        {
        cin>>tmp1>>tmp2;
        graph[tmp1].push_back(tmp2);
        graph[tmp2].push_back(tmp1);
        }
    vector<int> ends;
    for(int i=1;i<=n;i++)
        {
        if(graph[i].size()==1)
            {
            ends.push_back(i);
            }
        }
  //  for(auto x : ends)
  //      {
   //     cout<<x<<" ";
   //     }
   vector<bool> visit(n+1,false);
   set<int> ans;
   for(auto i : ends)
    {
    if(!visit[i])
        {
        visit[i]=true;
        if(!visit[graph[i][0]])
            {
            solver(visit,graph[i][0],graph,ans);
            }

        }
    }
   cout<<ans.size()<<endl;
   for(auto x : ans)
    {
    cout<<x<<" ";
    }
    return 0;
}