/**
 *    author:   K.R.Surrya  
 *    created:  02.06.2020 17:49:28
**/
#include<bits/stdc++.h>
using namespace std; 
using lint  =                           long long int;
using pint  =                           pair<int, int>;
using plint =                           pair<lint, lint>;
#define vli                             vector<lint>
#define pb                              push_back
#define ALL(x)                          begin(x),end(x)
#define inf                             (1LL<63)-1
#define MOD                             1000000007
#define SZ(x)                           ((lint)(x).size())
#define                                 FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define                                 IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define                                 REP(i, n) FOR(i,0,n)
#define                                 IREP(i, n) IFOR(i,0,n)
#define                                 f_ip   ios_base::sync_with_stdio(false); cin.tie(NULL);
#define                                 debug(x) cerr << #x << " " << (x) << endl
struct fast_ios                         { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T>                    istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T>                    bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T>                    bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
mt19937                                 rng(chrono::steady_clock::now().time_since_epoch().count());
lint pow_mod(lint base,lint expo) { 
   lint ret = 1;
   for(;expo;) { 
      if(expo&1)  ret = (ret*base)%MOD; 

      expo = (expo>>1);
      base = (base*base)%MOD;
   }
   return ret;
}
#define sim template <class c
#define ris return *this
#define dor > deb &operator<<
#define eni(x)                                                                  \
    sim > typename enable_if<sizeof dud<c>(0) x 1, deb &>::type operator<<(c i) \
    {
sim > struct rge
{
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct deb
{
#ifdef LOCAL
    ~deb()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;
#define simsim(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// -DLOCAL

vector<vector<int>> graph(100009);

void solve() {
     int n,m;
     cin >> n >> m ; 

     for(int i=0;i<m;++i) { 
         int u,v;cin >> u >> v;
         graph[u].pb(v);
         graph[v].pb(u);
     }

     vector<int> ret(n+1);
     vector<bool> viz(n+1,false);
     queue<pair<int,int>> q;
     q.push({1,-1});

     while(q.size()) { 

         pint rem=q.front(); q.pop();

         if(viz[rem.first]) continue;       

         if(rem.second != -1) { 
             ret[rem.first]=rem.second;
             deb() << simsim(rem.first) simsim(rem.second);
         }
         viz[rem.first]=true;

         for(auto child:graph[rem.first]) { 
             q.push({child,rem.first});
         }
     }

     bool ok=1;
     for(int i=2;i<=n;++i) { 
         if(viz[i]==false) { 
             ok=0;break;
         }
     }

     if(!ok) { 
         cout << "No";
         return ;
     }

     cout << "Yes" << '\n';
     for(int i=2;i<=n;++i) { 
         cout << ret[i] << '\n';
     }

}

int main()
{   
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);


     auto start = chrono::high_resolution_clock::now();

     int T=1;
     //cin>>T;
     for(int tt=1;tt<=T;++tt) {
         solve();
     }
     auto end = chrono::high_resolution_clock::now();

     cerr << " Execution time : " << chrono::duration_cast<chrono::milliseconds>(end-start).count()<<"ms"<<endl;

   
    return 0;
}


Measured memory_bytes: 12284