#include <bits/stdc++.h>
#include <algorithm>

using namespace std;

int main() {
    int village_count;
    cin >> village_count;
    int road_count;
    cin >> road_count;

    vector<vector<int>> village_tree(village_count);

    for (int i = 0; i < road_count; i++) {

        int village_id;
        int destination_id;


        cin >> village_id >> destination_id;

        if (!count(village_tree[village_id - 1].begin(), village_tree[village_id - 1].end(), destination_id - 1)) {
            village_tree[village_id - 1].push_back(destination_id - 1);
        }
        if (!count(village_tree[destination_id - 1].begin(), village_tree[destination_id - 1].end(), village_id - 1)) {
            village_tree[destination_id - 1].push_back(village_id - 1);
        }

    }

    vector<int> reachable;

    for (int i = 0; i < village_count; i++) {
        if (village_tree[i].size() != 1)
            continue;
        bool stop = false;
        int prev = i;
        if (village_tree[village_tree[i][0]].size() > 2) {
            reachable.push_back(village_tree[i][0]);
            continue;
        }
        int check = village_tree[i][0];
        while (!stop) {
            if (village_tree[check].size() > 2){
                reachable.push_back(check);
                stop = true;
            }
            else if (village_tree[check].size() == 2) {
                reachable.push_back(check);
                if (village_tree[check][0] == prev)
                    check = village_tree[check][1];
                else
                    check = village_tree[check][0];
            } else {
                stop = true;
                reachable.push_back(check);
            }
        }

    }
    cout << reachable.size() << endl;

    sort(reachable.begin(), reachable.end());

    for (int i = 0; i < reachable.size(); i++) {
        cout << reachable[i] + 1 << " ";
    }
    cout << endl;


    return 0;
}