import java.security.KeyStore.TrustedCertificateEntry
import java.util
import java.util.regex.Pattern
import java.util.{ArrayList, Collections, Comparator, List => JList}

import scala.collection.immutable.TreeMap
import scala.math._
import scala.collection.mutable
import scala.collection.mutable.{ArrayBuffer, ListBuffer}
import scala.util.{Failure, Success, Try}

object Main{
  val LINE_SEPARATOR = "\n"
  def main(args: Array[String]): Unit = {
    if (sys.env.getOrElse("TEST", "")=="1"){
      println(test());
    }else{
      val input=io.Source.stdin.getLines().mkString(LINE_SEPARATOR);
      println(solve(input).trim());
    }
  }

  def init (nRows: Int, nCols: Int, default: Int) = Array.tabulate(nRows,nCols)( (x,y) =>  default)

  def sortIgnoreCase1(list: JList[String]): JList[String] = {
    val r = new ArrayList[String](list)
    Collections.sort(r, new Comparator[String] {
      override def compare(o1: String, o2: String): Int = o1.compareToIgnoreCase(o2)
    })
    r
  }

  def solve(input: String): String = {
    case class Room(no: Int, var dis: Int, var nextRooms: List[Int], var point: Int){
      def setDisPoi(d: Int, p: Int): Room = Room(this.no, d, this.nextRooms, p)
    }
    val Array(n, m) = input.split(LINE_SEPARATOR).head.split(" ").map(_.toInt)
    val inf = pow(10, 6).toInt
    val roomList = (0 until n).map(i => Room(i, inf, List.empty[Int], 0)).toArray
    input.split(LINE_SEPARATOR).tail.foreach{l =>
      val Array(ai, bi) = l.split(" ").map(_.toInt)
      roomList(ai-1).nextRooms = (bi - 1) +: roomList(ai-1).nextRooms
      roomList(bi-1).nextRooms = (ai - 1) +: roomList(bi-1).nextRooms
    }
    val que = new mutable.Queue[Int].empty
    que.enqueue(0)
    roomList(0) = roomList(0).setDisPoi(0, 0)
    var d = 0
    while (que.nonEmpty) {
      d += 1
      val q = que.dequeue
      for (i <- roomList(q).nextRooms){
        if (roomList(i).dis == inf) {
          que.enqueue(roomList(i).no)
          roomList(i) = roomList(i).setDisPoi(d, q)
        }
      }
    }
    "Yes" + LINE_SEPARATOR + roomList.tail.map(_.point + 1).mkString(LINE_SEPARATOR)
  }

  def getListMax(x: Long): Long = {
    val list = (2L to 50L).scanLeft(1L)(_+_)
    list.count(_ <= x).toLong
  }


  def factorize(x: Long): List[Long] = {
    def foo(x: Long, a: Long = 2, list: List[Long] = Nil): List[Long] = a*a > x match {
      case false if x % a == 0 => foo(x / a, a    , a :: list)
      case false               => foo(x    , a + 1, list)
      case true                => x :: list
    }
    foo(x)
  }

  def divisors(n: Long): Vector[Long] = {
    val halfList = (1 to sqrt(n).toInt).toVector.filter(_ % n == 0).map(_.toLong)
    val reversedList = if (sqrt(n).floor == sqrt(n)) halfList.reverse.tail.map(n/_) else halfList.reverse.map(n/_)
    halfList ++ reversedList
  }

  def gcd(m: Long, n: Long): Long = n match {
    case 0 => m
    case _ => gcd(n, m % n)
  }
  def lcm(a: Long, b: Long): Long = a * b / gcd(a, b)

  val tests=List(
    """4 4
      |1 2
      |2 3
      |3 4
      |4 2""".stripMargin -> """Yes
                                   |1
                                   |2
                                   |2
                                   |
                              |""".stripMargin,
    """6 9
      |3 4
      |6 1
      |2 4
      |5 3
      |4 6
      |1 5
      |6 2
      |4 5
      |5 6""".stripMargin -> """Yes
                                   |6
                                   |5
                                   |5
                                   |1
                                   |1
                                   |
                                                 |
                                                 |
                                                 |
                                                 |
                                                 |
                                                 |
                                                 |""".stripMargin
  )

  def test():String= {
    return tests.map{case (i,o)=>(i.trim(),o.trim())}
      .zipWithIndex.map{
      case ((input,outputExpect),i)=>{
        val output=solve(input).trim();
        s"test${i+1}:"+(if(output==outputExpect){
          "Passed"
        }else{
          s"Failed\nexpect:\n${outputExpect}\noutput:\n${output}"
        })
      }}
      .mkString("\n");
  }
}

Measured memory_bytes: 108312