using System;
using System.Collections.Generic;
using System.Collections;
using System.Linq;
namespace Atcoder_0404
{
    class Program
    {
        static void Main(string[] args)
        {
            var NM = GetInput_int();
            var roomCount = NM[0];
            var pathCount = NM[1];
            List<int>[] connect = new List<int>[roomCount+1];
            for(int i = 0; i < roomCount + 1; i++)
            {
                connect[i] = new List<int>();
            }

            var uf = new UnionFind(roomCount+1);
            for (int i = 0; i < pathCount; i++)
            {
                var input = GetInput_int();
                var a = input[0];
                var b = input[1];
                if (a == 1)
                {
                    var temp = b;
                    b = a;
                    a = temp;
                }
                connect[a].Add(b);
                connect[b].Add(a);
                uf.Unite(a, b);
            }
            bool yes = true;
            for(int i = 1; i < roomCount+1; i++)
            {
                if (!uf.IsSameRoot(1,i))
                {
                    yes = false;
                    break;
                }
            }
            if (yes)
            {
                Console.WriteLine("Yes");
                int depth = 1;
                int[] result =new int[roomCount+1];
                bool[] looked = new bool[roomCount + 1];
                Queue<int> queue = new Queue<int>();
                Queue<int> depthQ = new Queue<int>();
                queue.Enqueue(1);
                depthQ.Enqueue(1);
                while (queue.Count != 0)
                {
                    var target = queue.Dequeue();
                    var d = depthQ.Dequeue();
                    var targetList = connect[target];
                    foreach(var t in targetList)
                    {
                        if (!looked[t])
                        {
                            looked[t] = true;
                            queue.Enqueue(t);
                            depthQ.Enqueue(target);
                        }
                    }
                    result[target] = d;
                }
                
                for(int i = 2; i < result.Length; i++)
                {
                    Console.WriteLine(result[i]);
                }
            }
            else
            {

                Console.WriteLine("No");
            }
        }
        
        #region input
        

        static string[] GetInput_string()
        {
            var input = Console.ReadLine().Split(' ');
            return input;
        }

        static int[] GetInput_int()
        {
            var input = GetInput_string();
            var result = new int[input.Length];
            for (int i = 0; i < result.Length; i++)
            {
                result[i] = int.Parse(input[i]);
            }
            return result;
        }
        static long[] GetInput_long()
        {
            var input = GetInput_string();
            var result = new long[input.Length];
            for (int i = 0; i < result.Length; i++)
            {
                result[i] = long.Parse(input[i]);
            }
            return result;
        }
        #endregion
        #region sonota
        static void Swap_array<T>(T[] target, int a, int b)
        {
            T temp = target[a];
            target[a] = target[b];
            target[b] = temp;
        }
        static void Swap_list<T>(List<T> target, int a, int b)
        {
            T temp = target[a];
            target[a] = target[b];
            target[b] = temp;
        }
        /// <summary>
        /// 最大公約数
        /// </summary>
        public static int GCD(int a, int b)
        {

            /* 自然数 a > b を確認・入替 */
            if (a < b)
            {
                int tmp = a;
                a = b;
                b = tmp;
            }

            /* ユークリッドの互除法 */
            int r = a % b;
            while (r != 0)
            {
                a = b;
                b = r;
                r = a % b;
            }
            return b;
        }

        /// <summary>
        /// 最小公倍数
        /// </summary>
        public static int LCM(int a, int b)
        {
            int x = a * b;
            b = GCD(a, b);
            return x / b;

        }
        #endregion

        static long mod = 1000000000 + 7;
        public class UnionFind
        {
            int[] _parent;

            public UnionFind(int _edgeCount)
            {
                _parent = new int[_edgeCount];
                for (int i = 0; i < _parent.Length; i++)
                {
                    _parent[i] = i;
                }
            }

            public int Root(int x)
            {
                if (_parent[x] == x)
                {
                    return x;
                }
                else
                {
                    _parent[x] = Root(_parent[x]);
                    return _parent[x];
                }
            }

            public bool IsSameRoot(int x, int y)
            {
                return Root(x) == Root(y);
            }

            public void Unite(int x, int y)
            {
                var _xRoot = Root(x);
                var _yRoot = Root(y);
                if (_xRoot == _yRoot) return;
                _parent[_xRoot] = _yRoot;
            }
        }
    }
}

Measured memory_bytes: 51552