/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author zjsdut
 */

#ifndef ALGO_UTILS
#define ALGO_UTILS
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#ifndef JHELPER_EXAMPLE_PROJECT_LIBRARY_IO_HPP_
#define JHELPER_EXAMPLE_PROJECT_LIBRARY_IO_HPP_
#include <iomanip>
#include <iostream>
#include <vector>
struct fast_ios {
  fast_ios() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(10);
  };
} fast_ios_;

template<typename T>
std::istream &operator>>(std::istream &stream, std::vector<T> &vec) {
  for (auto &x : vec) stream >> x;
  return stream;
}

template<typename T, typename U>
std::istream &operator>>(std::istream &in, std::pair<T, U> &p) {
  in >> p.first >> p.second;
  return in;
}

void scan() {}

template<class T, class... Args>
void scan(T &a, Args &... rest) {
  std::cin >> a;
  scan(rest...);
}

template<typename T>
std::ostream &operator<<(std::ostream &stream, const std::vector<T> &vec) {
  bool first = true;
  for (const T &t : vec) {
    if (first) first = false;
    else
      std::cout << ' ';
    std::cout << t;
  }
  return stream;
}

template<typename T, typename U>
std::ostream &operator<<(std::ostream &out, const std::pair<T, U> &p) {
  out << p.first << ' ' << p.second;
  return out;
}

template<typename T>
void print(const std::vector<std::vector<T>> &t) {
  for (const auto &row : t) { std::cout << row << '\n'; }
}

template<typename T>
void print(const T &t) {
  std::cout << t << ' ';
}

template<typename T, typename... Args>
void print(const T &t, const Args &... rest) {
  print(t);
  print(rest...);
}

template<typename T>
void println(const T &t) {
  std::cout << t << '\n';
}

template<typename T, typename... Args>
void println(const T &t, const Args &... rest) {
  print(t);
  println(rest...);
}
#endif//JHELPER_EXAMPLE_PROJECT_LIBRARY_IO_HPP_

#include <map>
#include <numeric>
#include <queue>
#include <set>
template<typename A, typename B>
bool chkmin(A &a, const B &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

template<typename A, typename B>
bool chkmax(A &a, const B &b) {
  if (b > a) {
    a = b;
    return true;
  }
  return false;
}

using ll = long long;
using ull = unsigned long long;
using vl = std::vector<ll>;
using vb = std::vector<bool>;
using vi = std::vector<int>;
using pii = std::pair<int, int>;
using pli = std::pair<ll, int>;
using pil = std::pair<int, ll>;
using pll = std::pair<ll, ll>;
using vpii = std::vector<pii>;
template<typename T>
class vv {
  std::vector<std::vector<T>> data;

 public:
  explicit vv(int n) {
    assert(n > 0);
    data.assign(n, std::vector<T>{});
  }
  vv(int n, int m, T init = T{}) {
    assert(n > 0 && m > 0);
    data.assign(n, std::vector<T>(m, init));
  }
  std::vector<T> &operator[](size_t i) { return data[i]; }
  void fill(T val) {
    for (auto &row : data) std::fill(row.begin(), row.end(), val);
  }
  friend std::istream &operator>>(std::istream &in, vv<T> &val) { return in >> val.data; }
};
#define rng3(i, a, b) for (std::common_type<decltype(a), decltype(b)>::type i = a; i < b; ++i)
#define rng2(i, n) rng3(i, 0, n)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define rng(...) GET_MACRO(__VA_ARGS__, rng3, rng2)(__VA_ARGS__)
#define up(i, a, b) for (std::common_type<decltype(a), decltype(b)>::type i = a; i <= b; ++i)
#define down(i, b, a) for (std::common_type<decltype(a), decltype(b)>::type i = b; i >= a; i--)
#define TOKENPASTE(x, y) x##y
#define TOKENPASTE2(x, y) TOKENPASTE(x, y)
#define rep(n)                                                                                     \
  for (std::remove_reference<decltype(n)>::type                                                    \
           TOKENPASTE2(_iter_, __LINE__) = 0,                                                      \
                               TOKENPASTE2(_num_, __LINE__) = n;                                   \
       TOKENPASTE2(_iter_, __LINE__) < TOKENPASTE2(_num_, __LINE__);                               \
       ++TOKENPASTE2(_iter_, __LINE__))
#define FOR(x, cont) for (const auto &x : cont)
#define For(x, cont) for (auto &x : cont)
#define ALL(x) begin(x), end(x)
// hat off to 300iq
#define RALL(x) rbegin(x), rend(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int) (x).size()
#define UNIQ(vec) (vec).erase(std::unique(ALL(vec)), std::end(vec))
#define LB(cont, x) int(std::lower_bound(ALL(cont), x) - std::begin(cont))
#define UB(cont, x) int(std::upper_bound(ALL(cont), x) - std::begin(cont))
template<typename T, typename U = std::less<T>>
using pq = std::priority_queue<T, std::vector<T>, U>;
template<typename T>
struct reversion_wrapper {
  T &iterable;
};
template<typename T>
auto begin(reversion_wrapper<T> w) {
  return std::rbegin(w.iterable);
}
template<typename T>
auto end(reversion_wrapper<T> w) {
  return std::rend(w.iterable);
}
template<typename T>
reversion_wrapper<T> reverse(T &&iterable) {
  return {iterable};
}
template<typename T, typename U>
T ceil(T x, U y) {
  assert(y > 0);
  if (x > 0) x += y - 1;
  return x / y;
}

template<typename T, typename U>
T floor(T x, U y) {
  assert(y > 0);
  if (x < 0) x -= y - 1;
  return x / y;
}
#endif// ALGO_UTILS
using namespace std;
class DDoubleDots {
 public:
  static void solve(istream &, ostream &) {
    int n, m;
    scan(n, m);
    vv<int> g(n);
    rep (m) {
      int u, v;
      scan(u, v);
      --u, --v;
      g[u].pb(v);
      g[v].pb(u);
    }
    queue<int> que;
    que.push(0);
    vi par(n, -1);
    par[0] = 0;
    while (!que.empty()) {
      int u = que.front();
      que.pop();
      FOR (v, g[u]) {
        if (par[v] == -1) {
          par[v] = u;
          que.push(v);
        }
      }
    }
    FOR (x, par)
      if (par[x] == -1) {
        println("No");
        return;
      }
    println("Yes");
    rng (i, 1, n)
      println(par[i] + 1);
  }
};
/*
 * Make sure that your laptop is plugged in or the build may be slow.
 */


int main() {
  DDoubleDots solver;
  auto& in = std::cin;
  auto& out = std::cout;
  solver.solve(in, out);
  return 0;
}


Measured memory_bytes: 10092