#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;
vector<int> adj[100001];
int h(int a, int b){
    return a < b;
}
int main()
{
    bool visited[10001]{ 0 };
    int jok[10001];
    int n, m,a,b,db=0;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> a >> b;
        adj[b].push_back(a);
        adj[a].push_back(b);
    }
    for (int i = 1; i <= n; i++) {
        if (adj[i].size() == 1) {
            int elozo = i;
            int most=adj[i][0];
            if (visited[most] == 0) {
                db++;
                jok[db] = most;
                visited[most] = 1;
            }
            while (adj[most].size() == 2) {
               
                if (adj[most][0] != elozo) {
                    elozo = most;
                    most = adj[elozo][0];
                    if (visited[most] == 0) {
                        db++;
                        jok[db] = most;
                        visited[most] = 1;
                    }
                    
                }
                else {
                    elozo = most;
                    most = adj[elozo][1];
                    if (visited[most] == 0) {
                        db++;
                        jok[db] = most;
                        visited[most] = 1;
                    }
                }
            }
        }
    }
    sort(jok + 1, jok + db + 1);
    cout << db << endl;
    for (int i = 1; i <= db; i++) {
        cout << jok[i]<<" ";
    }
}