using System;
using System.Collections.Generic;
using System.Text;
using Graph = System.Collections.Generic.List<System.Collections.Generic.List<int>>;

namespace AtCoder.Problems
{
    public class ProblemD
    {
        public static void Main(string[] args)
        {
            var s = new SolveD();
            s.Solve();
        }

        public class Scanner
        {
            private string[] _s;
            private int _i;
            private readonly char[] _separators = new char[] { ' ' };

            public Scanner()
            {
                _s = new string[0];
                _i = 0;
            }

            public string Next()
            {
                if (_i < _s.Length) return _s[_i++];
                string st = Console.ReadLine();
                while (st == "") st = Console.ReadLine();
                _s = st.Split(_separators, StringSplitOptions.RemoveEmptyEntries);
                if (_s.Length == 0) return Next();
                _i = 0;
                return _s[_i++];
            }

            public int NextInt() => int.Parse(Next());
            public long NextLong() => long.Parse(Next());
            public ulong NextULong() => ulong.Parse(Next());
            public double NextDouble() => double.Parse(Next());

            public int[] GetIntArray(int n, int add = 0)
            {
                int[] array = new int[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextInt() + add;
                }
                return array;
            }

            public long[] GetLongArray(int n, long add = 0)
            {
                long[] array = new long[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextLong() + add;
                }
                return array;
            }

            public double[] GetDoubleArray(int n, double add = 0)
            {
                double[] array = new double[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = NextDouble() + add;
                }
                return array;
            }

            public string[] GetStringArray(int n)
            {
                string[] array = new string[n];
                for (int i = 0; i < n; i++)
                {
                    array[i] = Next();
                }
                return array;
            }
        }
    }

    public class SolveD
    {
        public void Solve()
        {
            var cin = new ProblemD.Scanner();
            var n = cin.NextInt();
            var m = cin.NextInt();
            var g = new Graph(n + 1);
            for (int i = 0; i < n + 1; i++) { g.Add(new List<int>()); }

            for (int i = 0; i < m; i++)
            {
                var a = cin.NextInt();
                var b = cin.NextInt();
                g[a].Add(b);
                g[b].Add(a);
            }


            var result = GetAnswer(n, m, g);
            Console.WriteLine(result);
        }

        public string GetAnswer(int n, int m, Graph g)
        {
            var kanban = new int[n + 1];
            var queue = new Queue<int>();
            queue.Enqueue(1);

            while (queue.TryDequeue(out var room))
            {
                foreach (var nextRoom in g[room])
                {
                    if (nextRoom == 1 || kanban[nextRoom] > 0) { continue; }
                    queue.Enqueue(nextRoom);
                    kanban[nextRoom] = room;
                }
            }

            var sb = new StringBuilder();
            sb.AppendLine("Yes");
            for (int i = 2; i < kanban.Length; i++)
            {
                if (kanban[i] == 0) { return "No"; }
                sb.AppendLine(kanban[i].ToString());
            }

            return sb.ToString();
        }
    }
}


Measured memory_bytes: 51336