using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO.Pipes;
using System.Linq;
using System.Reflection.PortableExecutable;
using System.Runtime.InteropServices.ComTypes;
using System.Runtime.InteropServices.WindowsRuntime;
using System.Security.Cryptography.X509Certificates;

namespace cswork
{
    class Program
    {
        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);
                i = 0;
                return next();
            }

            public int nextInt()
            {
                return int.Parse(next());
            }

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

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

        public Program() { }

        static void Main(string[] args)
        {
            new Program().Omame();
        }

        Scanner cin;
        const int MAXIN = 1024;
        bool[] used = new bool[MAXIN];
        int[] perm = new int[MAXIN];

        List<int[]> permList = new List<int[]>();

        public void Permutation(int pos, int n, int length)
        {
            if (pos == n)
            {
                permList.Add((int[])perm.Clone());
            }

            for (int i = 0; i < n; i++)
            {
                if (!used[i])
                {
                    perm[pos] = i;
                    used[i] = true;
                    Permutation(pos + 1, n, length);
                    used[i] = false;
                }
            }
        }

        Queue<int> q = new Queue<int>();
        bool[] hasVisit;
        int[] prev;
        void bfs(List<List<int>> v)
        {
            while (q.Count != 0)
            {
                int now = q.Dequeue();
                for (int i = 0; i < v[now].Count; i++)
                {
                    int next = v[now][i];
                    if (!hasVisit[next])
                    {
                        hasVisit[next] = true;
                        prev[next] = now;
                        q.Enqueue(next);
                    }
                }
            }
        }

        void Omame()
        {
            cin = new Scanner();
            int n = cin.nextInt();
            int m = cin.nextInt();
            List<List<int>> v = new List<List<int>>();
            for (int i = 0; i < n; i++)
            {
                v.Add(new List<int>());
            }
            for (int i = 0; i < m; i++)
            {
                int a = cin.nextInt() - 1;
                int b = cin.nextInt() - 1;
                v[a].Add(b);
                v[b].Add(a);
            }

            hasVisit = new bool[n];
            prev = new int[n];
            for (int i = 0; i < n; i++)
            {
                prev[i] = -1;
            }

            q.Enqueue(0);
            bfs(v);

            Console.WriteLine("Yes");
            for (int i = 1; i < n; i++)
            {
                Console.WriteLine(prev[i] + 1);
            }
        }
    }
}


Measured memory_bytes: 51592