#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 998244353;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, -1, 1, 1, -1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t szi, szj;
        inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
    };
    inp inp1;

    struct Edge {
        ll from; // 移動前のノード
        ll to; // 移動先のノード
        ll cost; // 辺のコスト
        ll hoge; // 任意変更 いらないかも

        Edge() = default;
        Edge(ll _to) : from(-1), to(_to), cost(1), hoge(-1) {};
        Edge(ll _to, ll _cost) : from(-1), to(_to), cost(_cost), hoge(-1) {};
        Edge(ll _from, ll _to, ll _cost) : from(_from), to(_to), cost(_cost), hoge(-1) {};
        Edge(ll _from, ll _to, ll _cost, ll _hoge) : from(_from), to(_to), cost(_cost), hoge(_hoge) {};
        bool operator< (const Edge& rhs) const {
            return cost < rhs.cost;
        }
        bool operator> (const Edge& rhs) const {
            return cost > rhs.cost;
        }
    };

    using Graph = vector<vector<Edge>>;

    // ダイクストラ法 O(ElogV)
    vector<ll> dijkstra(ll start, const Graph& G) {
        vector<ll> dist(G.size(), infll);
        // 辺のコストが小さい順に取り出す　場合に応じて変更
        priority_queue<Edge, vector<Edge>, greater<Edge>> que;

        dist[start] = 0; // dist[i] := start->iまでの最短距離
        que.push(Edge(start, 0));

        while (!que.empty()) {
            ll cost, u; // 今までにかかった時間　現在の頂点
            cost = que.top().cost, u = que.top().to;
            que.pop();
            if (dist[u] < cost) continue;
            for (auto& e : G[u]) {
                ll v = e.to;
                ll new_cost = cost + e.cost;

                if (dist[v] <= new_cost) continue;

                dist[v] = new_cost;
                que.push(Edge(v, new_cost));
            }
        }
        return dist;
    }
}

int main() {

    int n, m;
    cin >> n >> m;
    Graph G(n);
    rep(i, m) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        G[a].emplace_back(Edge(b));
        G[b].emplace_back(Edge(a));
    }

    auto dist = dijkstra(0, G);

    bool ok = true;
    rep(i, n) {
        if (dist[i] == infll) {
            ok = false;
            break;
        }
    }
    if (!ok) {
        Cout("No");
        return 0;
    }

    vector<int> ans(n - 1, inf);
    Rep(i, 1, n) {
        ll mi = infll;
        int index = 0;
        for (auto edge : G[i]) {
            if (chmin(mi, dist[edge.to])) {
                index = edge.to;
            }
        }
        ans[i - 1] = index + 1;
    }

    Cout("Yes");
    rep(i, n - 1) Cout(ans[i]);

    return 0;
}


Measured memory_bytes: 29352