using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            var cin = new Scanner();
            var n = cin.nextInt();
            var m = cin.nextInt();

            var rList = new List<Node>();
            for (int i = 0; i < n; i++)
            {
                rList.Add(new Node { roomNo = i + 1, children = new List<int>() });
            }

            for (int i = 0; i < m; i++)
            {
                var from = cin.nextInt();
                var to = cin.nextInt();
                rList[from-1].children.Add(to);
                rList[to-1].children.Add(from);                
            }

            var visited = new bool[n];
            var que = new Queue<Tuple<int,int>>();
            var ans = new int[n];
            que.Enqueue(Tuple.Create(0,0));
            visited[0] = true;
            while (que.Count>0)
            {
                var tup = que.Dequeue();
                var i = tup.Item1;
                var now = tup.Item2;               

                var childList = rList[i];
                foreach (var cNode in childList.children)
                {
                    if (!visited[cNode-1])
                    {
                        que.Enqueue(Tuple.Create(cNode-1,now+1));
                        ans[cNode-1] = i+1;
                        visited[cNode-1] = true;
                    }
                }
            }

            for (int i = 1; i < n; i++)
            {
                if(ans[i] == 0)
                {
                    Console.WriteLine("No");
                    return;
                }
            }

            Console.WriteLine("Yes");
            for (int i = 1; i < n; i++)
            {
                Console.WriteLine(ans[i]);
            }
        }
    }
    class Node
    {
        public int roomNo { get; set; }
        public List<int> children { get; set; }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = 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(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 56416