#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
 
#define FS              ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll              long long  int
#define ld              long double
#define pi              acos(-1)   
#define pb              push_back
#define bp              __builtin_popcount
#define sz              size()
#define ff              first
#define ss              second
#define vll             vector<ll>
#define vbool           vector<bool>
#define vpll            vector<pair<ll,ll>>
#define pll             pair<ll,ll>
#define vllv            vector<vector<ll>>
#define setpri(x)       cout<<setprecision(x)<<fixed;
#define all(v)          v.begin(),v.end()
#define allr(v)         v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
// getline (std::cin,name);
ll MOD=1e9+7;
ll ceil1(ll n,ll x);
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll m,ll mod);
ll pow2(ll n,ll k);
ll modinv(ll n,ll mod){  return pow1(n,mod-2,mod);}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
        if(a.ff != b.ff)return a.ff < b.ff;
        return a.ss > b.ss;
}
void solve(){
        ll i,j,k,l,n,m,y,z,r,x;
        
        cin>>n>>m;
        
        vllv v(n+11);
        for(i=0;i<m;i++){
                cin>>x>>y;
                
                v[x].pb(y);
                v[y].pb(x);
        }
        
        vll dis(n+11,1e11);
        
        dis[1]=0;
        vbool vis(n+11);
        
        priority_queue<pll,vpll,greater<pll>> q;
        q.push({0,1});
        vll par(n+11);
        
        while(!q.empty()){
                ll p=q.top().ss;
                 q.pop();
                 
                 if(vis[p])continue;
                 
                 vis[p]=true;
                 
                 for(auto x: v[p]){
                         if(dis[x]>dis[p]+1){
                                 dis[x]=dis[p]+1;
                                 par[x]=p;
                                 q.push({dis[x],x});
                         }
                 }
        }
        
        for(i=1;i<=n;i++){
                if(dis[i]==1e11){
                        cout<<"No\n";
                        return;
                }
        }
        
        cout<<"Yes\n";
        for(i=2;i<=n;i++){
                cout<<par[i]<<endl;
        }
        
        
}
int main(){
        FS;
        ll i,j,k,n,m,x,y,z,q;
        q=1;
        // cin>>q;
        while(q--){
                solve();
        }
        return 0;
}
ll ceil1(ll n,ll x){
        return (n-1)/x+(n>0);
}
ll pow1(ll n,ll m,ll mod){
        if(m==0)return 1;
        
        if(m%2==0)return pow1((n*n)%mod,m/2,mod);
    	
    	return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}
ll pow2(ll n,ll k){
        ll ans=1;
            while(k>0){
                if(k%2==1)ans=ans*n;
                n=n*n;
                k/=2;
            }
            return ans;
}

Measured memory_bytes: 14980