#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct pont{vector<int>kim; int k=0; bool van=0;};
bool has(int a, int b) {
    return a<b;}
int main()
{
    int n,m,x,y;
    cin>>n>>m; pont a[n+1]; bool nincs=0;
    for(int i=0; i<m; i++){
        cin>>x>>y; a[x].kim.push_back(y);
        a[y].kim.push_back(x); a[x].k++; a[y].k++;}
    vector<int>zsak,l1,l2,l3;
    for(int i=1; i<=n; i++){if(a[i].k==1){zsak.push_back(i);}}
    for(int i=0; i<zsak.size(); i++){
        l1.clear(); l2.clear(); l1.push_back(zsak[i]); nincs=0;
        for(int j=1; j<=n; j++){a[j].van=0;} a[zsak[i]].van=1;
        while(nincs==0){
        if(l1.size()==0)nincs=1;
        for(int i=0; i<l1.size(); i++){
            for(int j=0; j<a[l1[i]].kim.size(); j++){
                if(a[a[l1[i]].kim[j]].van==0)
                    {l2.push_back(a[l1[i]].kim[j]); a[a[l1[i]].kim[j]].van=1;}}}
        l1.clear();
        for(int i=0; i<l2.size(); i++)
            {if(a[l2[i]].k<=2)l1.push_back(l2[i]);
            l3.push_back(l2[i]);} l2.clear();}}
    sort(l3.begin(),l3.end(),has);
    vector<int>ans; ans.push_back(l3[0]);
    for(int i=1; i<l3.size(); i++){if(l3[i]!=l3[i-1])ans.push_back(l3[i]);}
    if(ans.size()==0)cout<<"0";
    else{cout<<ans.size()<<endl;
        for(int i=0; i<ans.size(); i++){cout<<ans[i]<<" ";}}
    return 0;
}