using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;

namespace AtCoder
{
    static class Program_E
    {
        class Solver
        {

            private List<int>[] _t;
            private int[] _ms;
            private int _n;
            private int _m;

            public void Solve()
            {
                CreateFromInput();
                //CreateDummy();

                _ms = new int[_n + 1]; // MichiShirube
                _ms[1] = 9999; // tekitou
                var q = new Queue<int>();
                int next = 1;
                do
                {
                    foreach (var t in _t[next])
                    {
                        if (_ms[t] != 0) continue;
                        _ms[t] = next;
                        q.Enqueue(t);
                    }
                    if (q.Count == 0) break;
                    next = q.Dequeue();
                } while (true);

                Wl("Yes");
                for (int i = 2; i <= _n; ++i)
                {
                    Wl(_ms[i].ToString());
                }

            }

            private void CreateFromInput()
            {
                var nm = Ints(0);
                _n = nm[0];
                _m = nm[1];
                _t = new List<int>[_n + 1];
                for (int i = 1; i <= _n; ++i)
                {
                    _t[i] = new List<int>();
                }
                for (int i = 0; i < _m; ++i)
                {
                    var tmp = Ints(0);
                    _t[tmp[0]].Add(tmp[1]);
                    _t[tmp[1]].Add(tmp[0]);
                }
            }
            private void CreateDummy()
            {
                _n = 100000;
                _m = 200000;
                _t = new List<int>[_n + 1];
                for (int i = 1; i <= _n; ++i)
                {
                    _t[i] = new List<int>();
                }
                var r = new Random();
                for (int i = 0; i < _m; ++i)
                {
                    var tmp = new int[] { r.Next(1, _n), r.Next(1, _n) };
                    _t[tmp[0]].Add(tmp[1]);
                    _t[tmp[1]].Add(tmp[0]);
                }
            }
            void Search(int room)
            {
                //Wl(string.Format("room[{0}] : {1}", room, string.Join(",", _t[room].Select(a => a.ToString()).ToArray())));
                foreach (var t in _t[room])
                {
                    if (_ms[t] != 0) continue;
                    _ms[t] = room;
                }
                foreach (var t in _t[room])
                {
                    if (_ms[t] == room) Search(t);
                }
            }




            // ----------------------------------------------------------------------------
            void Wl(string mes)
            {
                Console.WriteLine(mes);
            }
            public int Int()
            {
                return int.Parse(Console.ReadLine());
            }
            public int[] Ints(int subtract)
            {
                return Console.ReadLine().Split(' ').Select(s => int.Parse(s) - subtract).ToArray();
            }
            public Int64[] Int64s(Int64 subtract)
            {
                return Console.ReadLine().Split(' ').Select(s => Int64.Parse(s) - subtract).ToArray();
            }
            public UInt64[] UInt64s(UInt64 subtract)
            {
                return Console.ReadLine().Split(' ').Select(s => UInt64.Parse(s) - subtract).ToArray();
            }


        }



        static void Main(string[] args)
        {
            new Solver().Solve();
        }
    }
    struct ModInt
    {
        const int MOD = 1000000007;
        long Data;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public ModInt(long data) { if ((Data = data % MOD) < 0) Data += MOD; }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static implicit operator long(ModInt modInt) => modInt.Data;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static implicit operator ModInt(long val) => new ModInt(val);
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt operator +(ModInt a, ModInt b)
        {
            long res = a.Data + b.Data;
            return new ModInt() { Data = res >= MOD ? res - MOD : res };
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt operator +(ModInt a, long b) => a.Data + b;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt operator -(ModInt a, ModInt b)
        {
            long res = a.Data - b.Data;
            return new ModInt() { Data = res < 0 ? res + MOD : res };
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt operator -(ModInt a, long b) => a.Data - b;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt operator *(ModInt a, ModInt b) => new ModInt() { Data = a.Data * b.Data % MOD };
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static ModInt operator /(ModInt a, ModInt b) => a.Data * GetInverse(b);

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string ToString() => Data.ToString();

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        static long GetInverse(long a)
        {
            long div;
            long p = MOD;
            long x1 = 1, y1 = 0, x2 = 0, y2 = 1;
            while (true)
            {
                if (p == 1) return x2;
                div = a / p;
                x1 -= x2 * div;
                y1 -= y2 * div;
                a %= p;
                if (a == 1) return x1;
                div = p / a;
                x2 -= x1 * div;
                y2 -= y1 * div;
                p %= a;
            }
        }
    }

}


Measured memory_bytes: 51592