#include                            <iostream>
#include                            <list>
#include                            <stdio.h>
#include                            <math.h>
#include                            <string.h>
#include                            <time.h>
#include                            <stdlib.h>
#include                            <string>
#include                            <bitset>
#include                            <vector>
#include                            <set>
#include                            <map>
#include                            <queue>
#include                            <algorithm>
#include                            <sstream>
#include                            <stack>
#include                            <iomanip>
#include                            <numeric>
#include                            <unordered_map>


using namespace                     std;
#define MOD                         1000000007
//#define int                         int64_t
#define baba_shiv                   ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mpii                        map<int,int>
#define pb                          push_back
#define mkp                         make_pair
#define all(x)                      x.begin(),x.end()
#define allr(x)                     x.rbegin(),x.rend()
#define ub(v,x)                     upper_bound(all(v),x)
#define lb(v,x)                     lower_bound(all(v),x)
#define bs(v,x)                     binary_search(all(v),x)
#define gcd(a,b)                    __gcd(a,b)
#define lcm(a,b)                    (((a*b))/__gcd(a,b))
#define vi                          vector<int>
#define pii                         pair<int,int>
#define vpii                        vector<pii>
#define vs                          vector<string>
#define ff                          first
#define ss                          second
#define foru(v,s,e)                 for(int v=s;v<e;v++)
#define ford(v,s,e)                 for(int v=s;v>e;v--)
#define pi                          3.14159265358979323846
/***********************************************************************************************************************/
template < typename F, typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "{";
    typename vector< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if ( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "}";
}

template < typename T >
ostream &operator << ( ostream & os, const set< T > &v ) {
    os << "[";
    typename set< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if ( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}

template < typename F, typename S >
ostream &operator << ( ostream & os, const map< F, S > &v ) {
    os << "[";
    typename map< F , S >::const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if ( it != v.begin() ) os << ", ";
        os << it -> first << " = " << it -> second ;
    }
    return os << "]";
}

#define deb(x) cerr<< #x << " = " << x << endl;


/***********************************************************************************************************************/

struct CustomCompare
{
    bool operator()(pair<int, pii> &a, pair<int, pii> &b)
    {
        if (a.ff == b.ff)
            return a.ss.ff > b.ss.ss;
        return a.ff < b.ff;
    }

};
vector<vi> graph;

vector<bool> vis;
void acde(vi &ans)
{
    queue<int> q;
    q.push(1);
    vis[1] = true;
    while (!q.empty())
    {

        int t = q.front();
        for (auto it : graph[t])
        {

            if (it == t or vis[it])
                continue;
            ans[it] = t;
            q.push(it);
            vis[it] = true;
        }
        q.pop();

    }
}





signed main()
{
    baba_shiv;

    int t = 1;
    //cin >> t;

    while (t--)
    {
        int n, m;
        cin >> n >> m;
        vi ans(n + 1, -1);
        vis.resize(n + 1, false);
        graph.resize(n + 1);
        for (int i = 0; i < m; i++)
        {
            int x, y;
            cin >> x >> y;
            graph[x].pb(y);
            graph[y].pb(x);
        }
        acde(ans);

        for (int i = 2; i <= n; i++)
        {
            if (ans[i] == -1)
            {
                cout << "No" << endl;
                return 0;
            }
        }
        cout << "Yes" << endl;
        for (int i = 2; i <= n; i++)
        {
            cout << ans[i] << endl;
        }
    }
    return 0;
}

Measured memory_bytes: 9816