// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll inf = 1e9;

#define sz              300005

#define Fast            ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int par[sz];

bool vis[sz];

vector < int > V[sz];



void bfs(int src){



    memset(vis,0,sizeof(vis));

    memset(par,0,sizeof(par));

    queue< int > q;

    q.push(1);

    vis[1]=0;



    while(!q.empty()){

        int u=q.front();

        q.pop();



        for(int i=0; i<V[u].size(); i++){

            int v=V[u][i];

            if(vis[v]==0){

                par[v]=u;

                vis[v]=1;

                q.push(v);

            }

        }

    }

}



int main(){

    Fast;

    int a,b,c, i,j, n,m,t, cs=1;



    cin>>n>>m;

    for(i=0; i<m; i++){

        cin>>a>>b;

        V[a].push_back(b);

        V[b].push_back(a);

    }

    bfs(1);



    bool flag=true;

    vector < int > pp;

    for(i=2; i<=n; i++){

        if(par[i]==0){

            flag=false;break;

        }

        pp.push_back(par[i]);

    }

    if(!flag){

        cout<<"No"<<endl;

    }

    else{

        cout<<"Yes"<<endl;

        for(i=0; i<n-1; i++){

            cout<<pp[i]<<endl;

        }

    }





    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.1337846625284087x):
#include<iostream>

#include<string>

#include<cstdio>

#include<vector>

#include<cmath>

#include<algorithm>

#include<functional>

#include<iomanip>

#include<queue>

#include<ciso646>

#include<random>

#include<map>

#include<set>

#include<bitset>

#include<stack>

#include<unordered_map>

#include<utility>

#include<cassert>

#include<complex>

#include<numeric>

using namespace std;



//#define int long long

typedef long long ll;



typedef unsigned long long ul;

typedef unsigned int ui;

constexpr ll mod = 998244353;

const ll INF = mod * mod;

typedef pair<int, int>P;

#define stop char nyaa;cin>>nyaa;

#define rep(i,n) for(int i=0;i<n;i++)

#define per(i,n) for(int i=n-1;i>=0;i--)

#define Rep(i,sta,n) for(int i=sta;i<n;i++)

#define rep1(i,n) for(int i=1;i<=n;i++)

#define per1(i,n) for(int i=n;i>=1;i--)

#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)

#define all(v) (v).begin(),(v).end()

typedef pair<ll, ll> LP;

typedef long double ld;

typedef pair<ld, ld> LDP;

const ld eps = 1e-12;

const ld pi = acos(-1.0);





struct modint {

	ll n;

	modint() :n(0) { ; }

	modint(ll m) :n(m) {

		if (n >= mod)n %= mod;

		else if (n < 0)n = (n%mod + mod) % mod;

	}

	operator int() { return n; }

};

bool operator==(modint a, modint b) { return a.n == b.n; }

modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }

modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }

modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }

modint operator+(modint a, modint b) { return a += b; }

modint operator-(modint a, modint b) { return a -= b; }

modint operator*(modint a, modint b) { return a *= b; }

modint operator^(modint a, int n) {

	if (n == 0)return modint(1);

	modint res = (a*a) ^ (n / 2);

	if (n % 2)res = res * a;

	return res;

}



ll inv(ll a, ll p) {

	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);

}

modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }



const int max_n = 1 << 19;

modint fact[max_n], factinv[max_n];

void init_f() {

	fact[0] = modint(1);

	for (int i = 0; i < max_n - 1; i++) {

		fact[i + 1] = fact[i] * modint(i + 1);

	}

	factinv[max_n - 1] = modint(1) / fact[max_n - 1];

	for (int i = max_n - 2; i >= 0; i--) {

		factinv[i] = factinv[i + 1] * modint(i + 1);

	}

}

modint comb(int a, int b) {

	if (a < 0 || b < 0 || a < b)return 0;

	return fact[a] * factinv[b] * factinv[a - b];

}





void solve() {

	int n, m; cin >> n >> m;

	vector<vector<int>> G(n);

	rep(i, m) {

		int a, b; cin >> a >> b; a--; b--;

		G[a].push_back(b);

		G[b].push_back(a);

	}

	vector<int> ans(n, -1);

	ans[0] = 0;

	queue<int> q;

	vector<bool> used(n, false);

	used[0] = true;

	q.push(0);

	while (!q.empty()) {

		int v = q.front(); q.pop();

		for (int to : G[v]) {

			if (used[to])continue;

			ans[to] = v;

			used[to] = true;

			q.push(to);

		}

	}

	rep(i, n)if (ans[i] < 0) {

		cout << "No\n"; return;

	}

	cout << "Yes\n";

	rep1(i, n - 1) {

		cout << ans[i] + 1 << "\n";

	}

}





signed main() {

	ios::sync_with_stdio(false);

	cin.tie(0);

	//cout << fixed << setprecision(7);

	//init_f();

	//init();

	//int t; cin >> t;rep(i,t)

	solve();

	stop

		return 0;

}