using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace elagazas_nelkuli
{
    class Program
    {
        static int[] dfs(List<List<int>> csucslista, int v, int n, List<int> path = null, bool[] check = null, bool breakk = false)
        {
            if (path == null)
                path = new List<int>();
            if (check == null)
                check = new bool[n+1];
            path.Add(v);
            check[v] = true;
            foreach (int i in csucslista[v])
            {
                if (!check[i])
                {
                    if (csucslista[i].Count >= 3 && breakk == false)
                    {
                        breakk = true;
                        dfs(csucslista, i, n, path, check, breakk);
                        break;
                    }
                    else if (csucslista[i].Count < 3 && breakk == false)
                    {
                        dfs(csucslista, i, n, path, check, breakk);
                    }
                    /*else if (breakk)
                        break;*/
                }
                
            }
            return path.ToArray();
        }
        static void Main(string[] args)
        {
            int[] be = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            int n = be[0];
            int m = be[1];
            List<List<int>> csucsok = new List<List<int>>(n+1);
            for (int i = 0; i <= n; i++)
            {
                csucsok.Add(new List<int>(n-1));
            }
            for (int i = 0; i < m; i++)
            {
                int[] bekeres = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
                int a = bekeres[0];
                int b = bekeres[1];
                csucsok[a].Add(b);
                csucsok[b].Add(a);
            }
            List<int> zsakok = new List<int>();
            for (int i = 0; i < csucsok.Count; i++)
            {
                if (csucsok[i].Count == 1)
                    zsakok.Add(i);
            }
            List<int> dfss = new List<int>();
            for (int i = 0; i < zsakok.Count; i++)
            {
                int[] ki = dfs(csucsok, zsakok[i], n);
                foreach (int k in ki)
                    dfss.Add(k);
            }
            List<int> rendez = dfss.OrderBy(c => c).ToList();
            Console.WriteLine(rendez.Count-zsakok.Count);
            foreach (int i in rendez)
            {
                if (!zsakok.Contains(i))
                    Console.Write(i + " ");
            }
            if (rendez.Count - zsakok.Count == 0)
            {
                Console.WriteLine();
            }
            Console.ReadKey();
        }
    }
}