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

void bejar(int x, set <int> &megold, int fokszam[], int n, vector <int> a){
    int i;
    bool volt[10001] = {0};
    volt[x] = 1;
    do{
        i = 1;
        while(i <= n && a[x*(n+1)+i+1]!= 1){
            i ++;
        }
        if(volt[i] == 1){
            i++;
             while(i <= n && a[x*(n+1)+i+1]!= 1){
            i ++;
        }
        }
        if(i <= n && fokszam[i] != 1){
            megold.insert(i);
            volt[i] = 1;
        }
        x = i;
    }while(fokszam[x] == 2);
}

int main()
{
    vector <int> a;
    int  n, m;
    cin >> n >> m;
    a.resize((n+1)*(n+1));
    int x, y;
    for(int i = 0; i < m; i ++){
        cin >> x >> y;
        a[x*(n+1)+y+1] = 1;
        a[y*(n+1)+x+1] = 1;
    }
    for(int i=1; i <= (n+1)*(n+1); i++ )
    {
        cout << a[i] << " ";
        if(i%(n+1)==0)
        cout << endl;
    }
    int fokszam[10001] = {0};
    for(int i = 1 ; i <= n; i ++){
        for(int j = 1 ; j <= n; j ++){
            fokszam[i] += a[i*(n+1)+j+1];
        }
    }
    set <int> halmaz;
    for(int i = 1; i <= n; i ++){
        if(fokszam[i] == 1){
            bejar(i, halmaz, fokszam,n,a);
        }
    }
    cout << halmaz.size() << endl;
    for(auto i : halmaz)
        cout << i << " ";
    return 0;
}