//
// ABC168D
// URL : https://atcoder.jp/contests/abc168/tasks/abc168_d
// 
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.ComponentModel.Design;
using System.Reflection.Metadata.Ecma335;
using System.Xml.Schema;

namespace AtCoder
{
    class ABC168D
    {
        public static readonly long MOD_CONST = 1000000007;//(long)Math.Pow(10, 9) + 7;

        static void Main(string[] args)
        {
            //出力高速化
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(sw);
            Solve();
            Console.Out.Flush();
        }

        public static int N;
        public static int M;
        public static List<int>[] RoomPath;
        public static bool[] visited;
        public static int[] roomMarks;
        public static void Solve()
        {
            {
                var inputArray = Console.ReadLine().Split(' ').Select(_inputStr => int.Parse(_inputStr)).ToArray();
                N = inputArray[0];
                M = inputArray[1];
            }
            RoomPath = new List<int>[N];
            for(int i = 0; i < N; ++i)
            {
                RoomPath[i] = new List<int>();
            }
            for (int i = 0; i < M; ++i)
            {
                var inputArray = Console.ReadLine().Split(' ').Select(_inputStr => int.Parse(_inputStr)).ToArray();
                int a = inputArray[0] - 1;//0 index
                int b = inputArray[1] - 1;
                RoomPath[a].Add(b);//room aからつながっている部屋はRoomPath[a]にあつまる
                RoomPath[b].Add(a);
            }
            roomMarks = new int[N];
            visited = new bool[N];

            bfs();

            {
                Console.WriteLine("Yes");//経路は必ず見つかる
                for (int i = 1; i < roomMarks.Length; ++i)
                {
                    Console.WriteLine(roomMarks[i] + 1);
                }
            }
        }

        public static void bfs()
        {
            var NextRooms = new Queue<int>(N);
            NextRooms.Enqueue( 0 );

            roomMarks[0] = 0;

            while (NextRooms.Count != 0)
            {
                int currRoomIdx = NextRooms.Dequeue();
                //その部屋からつながっている部屋だけを見る
                foreach (var nextRoomIdx in RoomPath[currRoomIdx])
                {
                    //BFSの性質上、最初に訪れた頂点は必ず開始点から最短経路を取る
                    //よってすでに来ていたら、もう見なくてもいい
                    if(visited[nextRoomIdx] == true) { continue; }
                    visited[nextRoomIdx] = true;

                    //次の部屋の道標は、今の部屋を指すようにする
                    roomMarks[nextRoomIdx] = currRoomIdx;

                    NextRooms.Enqueue(nextRoomIdx);
                }
            }
        }


        //---------------------------------------------------------------------------------

        /// <summary>
        /// 指定された底log_baseでの, 対数を計算
        /// </summary>
        /// <param name="x"></param>
        /// <param name="log_base">指定の底</param>
        /// <returns></returns>
        public static double LogBase(double x, double log_base)
        {
            //log_b(N) = log_a(N) / log_a(B)より
            return Math.Log(x) / Math.Log(log_base);
        }

        /// <summary>
        /// 初項a, 公差d, 項数nの数列の和
        /// </summary>
        /// <param name="n">求めたいところ</param>
        /// <returns>初項からxまで足した値</returns>
        static long SumSeries(long a, long d, long n)
        {
            return (2 * a + (n-1) * d) * n / 2;
        }
        /// <summary>
        /// 累積和の配列を計算する
        /// Sum[ a[0], a[i] )がs[i+1]に入っている
        /// s[0]  : 0                //一切和を取らない場合
        /// s[1]  : ls[0]            //a[0]   + s[0] = a[0]
        /// s[2]  : ls[1] + s[1]     //a[1]   + a[0]
        /// ...
        /// s[N]  : ls[N-1] + s[N-1] //a[N-1] + ... + a[0]
        /// s[N+1]: ls[N] + s[N]     //a[N]   + ... + a[0]
        /// 
        /// 例: [1, 7)の和(a[1] + ... + a[6])
        /// s[1] = a[0] //[0, 1)
        /// s[7] = a[0] + a[1] + ... + a[6] //[0, 7)
        /// よってs[7] - s[1]);
        /// </summary>
        /// <param name="ls">計算したい配列</param>
        /// <returns>累積和配列</returns>
        static List<long> AggregateSumList(List<long> a)
        {
            var s = new List<long>(a.Count+1);
            if(a.Count == 0)
            {
                return s;
            }
            s.Add(0);//s[0] = 0
            for(int i = 0; i < a.Count; ++i)
            {
                s.Add(a[i] + s[i]);
            }
            return s;
        }


        /// <summary>
        /// 与えられた数が素数かどうかを計算する
        /// </summary>
        /// <param name="num">対象数</param>
        /// <returns>true:素数, false:素数ではない(合成数)</returns>
        public static bool isPrime(int num)
        {
            if (num < 2) return false;
            else if (num == 2) return true;
            else if (num % 2 == 0) return false;

            double sqrtNum = Math.Sqrt(num);
            for (int i = 3; i <= sqrtNum; i += 2)
            {
                if (num % i == 0)
                {
                    return false;
                }
            }
            return true;
        }

        /// <summary>
        /// 順列mPnを計算する
        /// </summary>
        /// <param name="m"></param>
        /// <param name="n"></param>
        /// <returns></returns>
        public static long Permutation(long m, long n)
        {
            long ret = 1;
            for(var i = 0; i < n; ++i)
            {
                ret *= m - i;
            }
            return ret;
        }
        /// <summary>
        /// 組み合わせmCnを計算する
        /// </summary>
        /// <param name="m"></param>
        /// <param name="n"></param>
        /// <returns></returns>
        public static long Combination(long m, long n)
        {
            if (m == n || n == 0)
            {
                return 1;
            }
            long ans = 1;
            for (var i = 1; i <= n; ++i)
            {
                ans = ans * (m - i + 1) / i;
            }
            return ans;
        }

        static long Gcd(long m, long n)
        {
            if (n == 0) return m;
            return Gcd(n, m % n);
        }

        static long Lcm(long m, long n)
        {
            var gcd = Gcd(m, n);
            //return (m * n) / gcd;
            return m / gcd * n;//桁あふれ対策
        }
    }
}



Measured memory_bytes: 51484